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_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:04:50,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:04:50,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:04:50,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:04:50,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:04:50,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:04:50,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:04:50,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:04:50,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:04:50,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:04:50,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:04:50,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:04:50,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:04:50,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:04:50,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:04:50,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:04:50,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:04:50,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:04:50,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:04:50,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:04:50,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:04:50,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:04:50,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:04:50,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:04:50,480 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:04:50,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:04:50,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:04:50,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:04:50,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:04:50,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:04:50,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:04:50,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:04:50,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:04:50,487 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:04:50,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:04:50,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:04:50,489 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-26 20:04:50,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:04:50,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:04:50,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:04:50,514 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:04:50,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:04:50,515 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:04:50,515 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:04:50,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:04:50,516 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:04:50,516 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:04:50,516 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:04:50,516 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:04:50,516 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:04:50,517 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:04:50,517 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:04:50,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:04:50,517 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:04:50,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:04:50,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:04:50,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:04:50,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:04:50,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:04:50,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:04:50,519 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:04:50,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:04:50,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:04:50,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:04:50,519 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:04:50,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:04:50,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:04:50,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:04:50,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:04:50,597 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:04:50,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label44_true-unreach-call.c [2018-10-26 20:04:50,668 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/644a40898/a7eb64ed0e054c9a82345787f26ecb0a/FLAG565cba7fd [2018-10-26 20:04:51,386 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:04:51,386 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label44_true-unreach-call.c [2018-10-26 20:04:51,408 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/644a40898/a7eb64ed0e054c9a82345787f26ecb0a/FLAG565cba7fd [2018-10-26 20:04:51,433 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/644a40898/a7eb64ed0e054c9a82345787f26ecb0a [2018-10-26 20:04:51,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:04:51,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:04:51,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:04:51,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:04:51,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:04:51,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:04:51" (1/1) ... [2018-10-26 20:04:51,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@decac2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:51, skipping insertion in model container [2018-10-26 20:04:51,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:04:51" (1/1) ... [2018-10-26 20:04:51,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:04:51,576 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:04:52,240 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:04:52,247 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:04:52,513 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:04:52,541 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:04:52,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52 WrapperNode [2018-10-26 20:04:52,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:04:52,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:04:52,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:04:52,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:04:52,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:52,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:52,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:04:52,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:04:52,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:04:52,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:04:52,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:52,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:52,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:52,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:53,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:53,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:53,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (1/1) ... [2018-10-26 20:04:53,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:04:53,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:04:53,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:04:53,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:04:53,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (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-26 20:04:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:04:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:04:53,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:04:58,561 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:04:58,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:04:58 BoogieIcfgContainer [2018-10-26 20:04:58,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:04:58,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:04:58,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:04:58,569 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:04:58,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:04:51" (1/3) ... [2018-10-26 20:04:58,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e699e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:04:58, skipping insertion in model container [2018-10-26 20:04:58,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:52" (2/3) ... [2018-10-26 20:04:58,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e699e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:04:58, skipping insertion in model container [2018-10-26 20:04:58,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:04:58" (3/3) ... [2018-10-26 20:04:58,574 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label44_true-unreach-call.c [2018-10-26 20:04:58,586 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:04:58,597 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:04:58,616 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:04:58,656 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:04:58,656 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:04:58,657 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:04:58,657 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:04:58,657 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:04:58,657 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:04:58,657 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:04:58,658 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:04:58,658 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:04:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:04:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 20:04:58,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:58,707 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] [2018-10-26 20:04:58,710 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:58,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:58,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2027933188, now seen corresponding path program 1 times [2018-10-26 20:04:58,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:58,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:58,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:58,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:58,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:59,688 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-26 20:04:59,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:59,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:59,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:59,717 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:05:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:03,060 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-26 20:05:03,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:03,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-10-26 20:05:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:03,098 INFO L225 Difference]: With dead ends: 1072 [2018-10-26 20:05:03,098 INFO L226 Difference]: Without dead ends: 762 [2018-10-26 20:05:03,103 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-26 20:05:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-26 20:05:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-26 20:05:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-26 20:05:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-26 20:05:03,195 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 178 [2018-10-26 20:05:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:03,196 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-26 20:05:03,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-26 20:05:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:05:03,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:03,202 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:03,202 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:03,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1939659693, now seen corresponding path program 1 times [2018-10-26 20:05:03,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:03,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:03,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:03,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:03,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:03,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:03,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:03,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:03,445 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-26 20:05:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:06,716 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-10-26 20:05:06,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:06,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 20:05:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:06,725 INFO L225 Difference]: With dead ends: 1918 [2018-10-26 20:05:06,726 INFO L226 Difference]: Without dead ends: 1402 [2018-10-26 20:05:06,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-10-26 20:05:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-10-26 20:05:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-26 20:05:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-26 20:05:06,788 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 184 [2018-10-26 20:05:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:06,788 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-26 20:05:06,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-26 20:05:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 20:05:06,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:06,796 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] [2018-10-26 20:05:06,796 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:06,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash 177038139, now seen corresponding path program 1 times [2018-10-26 20:05:06,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:06,898 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-26 20:05:06,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:06,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:06,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:06,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:06,900 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-26 20:05:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:09,376 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-26 20:05:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:09,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-10-26 20:05:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:09,388 INFO L225 Difference]: With dead ends: 2699 [2018-10-26 20:05:09,389 INFO L226 Difference]: Without dead ends: 1768 [2018-10-26 20:05:09,391 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-26 20:05:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-26 20:05:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-26 20:05:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-26 20:05:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-26 20:05:09,433 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 187 [2018-10-26 20:05:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:09,433 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-26 20:05:09,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-26 20:05:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 20:05:09,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:09,439 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:09,440 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:09,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1558635668, now seen corresponding path program 1 times [2018-10-26 20:05:09,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:09,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:09,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:09,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:09,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:09,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:09,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:09,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:09,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:09,556 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 4 states. [2018-10-26 20:05:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:12,897 INFO L93 Difference]: Finished difference Result 6814 states and 10581 transitions. [2018-10-26 20:05:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:12,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-10-26 20:05:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:12,924 INFO L225 Difference]: With dead ends: 6814 [2018-10-26 20:05:12,924 INFO L226 Difference]: Without dead ends: 5065 [2018-10-26 20:05:12,927 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-26 20:05:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2018-10-26 20:05:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 3388. [2018-10-26 20:05:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-10-26 20:05:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4947 transitions. [2018-10-26 20:05:13,017 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4947 transitions. Word has length 194 [2018-10-26 20:05:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:13,018 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 4947 transitions. [2018-10-26 20:05:13,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4947 transitions. [2018-10-26 20:05:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 20:05:13,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:13,026 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] [2018-10-26 20:05:13,026 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:13,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1406070287, now seen corresponding path program 1 times [2018-10-26 20:05:13,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:13,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:13,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:13,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:13,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:13,369 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-26 20:05:13,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:13,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:13,371 INFO L87 Difference]: Start difference. First operand 3388 states and 4947 transitions. Second operand 3 states. [2018-10-26 20:05:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:14,801 INFO L93 Difference]: Finished difference Result 10057 states and 14733 transitions. [2018-10-26 20:05:14,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:14,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-10-26 20:05:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:14,830 INFO L225 Difference]: With dead ends: 10057 [2018-10-26 20:05:14,830 INFO L226 Difference]: Without dead ends: 6671 [2018-10-26 20:05:14,836 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-26 20:05:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2018-10-26 20:05:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6652. [2018-10-26 20:05:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-10-26 20:05:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 9399 transitions. [2018-10-26 20:05:14,968 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 9399 transitions. Word has length 195 [2018-10-26 20:05:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:14,969 INFO L481 AbstractCegarLoop]: Abstraction has 6652 states and 9399 transitions. [2018-10-26 20:05:14,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 9399 transitions. [2018-10-26 20:05:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-26 20:05:14,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:14,988 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:14,988 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:14,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:14,989 INFO L82 PathProgramCache]: Analyzing trace with hash 995862124, now seen corresponding path program 1 times [2018-10-26 20:05:14,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:14,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:14,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:14,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:14,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 20:05:15,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:15,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:15,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:15,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:15,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:15,195 INFO L87 Difference]: Start difference. First operand 6652 states and 9399 transitions. Second operand 3 states. [2018-10-26 20:05:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:16,201 INFO L93 Difference]: Finished difference Result 13270 states and 18753 transitions. [2018-10-26 20:05:16,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:16,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-10-26 20:05:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:16,222 INFO L225 Difference]: With dead ends: 13270 [2018-10-26 20:05:16,222 INFO L226 Difference]: Without dead ends: 6620 [2018-10-26 20:05:16,231 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-26 20:05:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-10-26 20:05:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-10-26 20:05:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-10-26 20:05:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 9200 transitions. [2018-10-26 20:05:16,353 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 9200 transitions. Word has length 209 [2018-10-26 20:05:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:16,354 INFO L481 AbstractCegarLoop]: Abstraction has 6620 states and 9200 transitions. [2018-10-26 20:05:16,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 9200 transitions. [2018-10-26 20:05:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-26 20:05:16,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:16,368 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:16,369 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:16,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:16,369 INFO L82 PathProgramCache]: Analyzing trace with hash -362216596, now seen corresponding path program 1 times [2018-10-26 20:05:16,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:16,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:16,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:16,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:16,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:16,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:16,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:16,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:16,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:16,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:16,600 INFO L87 Difference]: Start difference. First operand 6620 states and 9200 transitions. Second operand 3 states. [2018-10-26 20:05:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:18,420 INFO L93 Difference]: Finished difference Result 15495 states and 21391 transitions. [2018-10-26 20:05:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:18,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-26 20:05:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:18,460 INFO L225 Difference]: With dead ends: 15495 [2018-10-26 20:05:18,460 INFO L226 Difference]: Without dead ends: 8877 [2018-10-26 20:05:18,469 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-26 20:05:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2018-10-26 20:05:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 8876. [2018-10-26 20:05:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8876 states. [2018-10-26 20:05:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8876 states to 8876 states and 12095 transitions. [2018-10-26 20:05:18,704 INFO L78 Accepts]: Start accepts. Automaton has 8876 states and 12095 transitions. Word has length 220 [2018-10-26 20:05:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:18,705 INFO L481 AbstractCegarLoop]: Abstraction has 8876 states and 12095 transitions. [2018-10-26 20:05:18,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 8876 states and 12095 transitions. [2018-10-26 20:05:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-26 20:05:18,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:18,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, 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] [2018-10-26 20:05:18,725 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:18,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1263477528, now seen corresponding path program 1 times [2018-10-26 20:05:18,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:18,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:18,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:18,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:19,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:19,062 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-26 20:05:19,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:19,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:05:19,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:05:19,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 20:05:19,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:19,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:19,305 INFO L87 Difference]: Start difference. First operand 8876 states and 12095 transitions. Second operand 7 states. [2018-10-26 20:05:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:25,301 INFO L93 Difference]: Finished difference Result 29599 states and 39653 transitions. [2018-10-26 20:05:25,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:05:25,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2018-10-26 20:05:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:25,339 INFO L225 Difference]: With dead ends: 29599 [2018-10-26 20:05:25,340 INFO L226 Difference]: Without dead ends: 20725 [2018-10-26 20:05:25,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:05:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20725 states. [2018-10-26 20:05:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20725 to 20719. [2018-10-26 20:05:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2018-10-26 20:05:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 23650 transitions. [2018-10-26 20:05:25,636 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 23650 transitions. Word has length 228 [2018-10-26 20:05:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:25,636 INFO L481 AbstractCegarLoop]: Abstraction has 20719 states and 23650 transitions. [2018-10-26 20:05:25,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 23650 transitions. [2018-10-26 20:05:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-26 20:05:25,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:25,667 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:25,667 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:25,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash -162429184, now seen corresponding path program 1 times [2018-10-26 20:05:25,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:25,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:05:25,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:25,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:25,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:25,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:25,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:25,833 INFO L87 Difference]: Start difference. First operand 20719 states and 23650 transitions. Second operand 3 states. [2018-10-26 20:05:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:27,307 INFO L93 Difference]: Finished difference Result 40008 states and 45800 transitions. [2018-10-26 20:05:27,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:27,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-26 20:05:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:27,355 INFO L225 Difference]: With dead ends: 40008 [2018-10-26 20:05:27,356 INFO L226 Difference]: Without dead ends: 19291 [2018-10-26 20:05:27,377 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-26 20:05:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19291 states. [2018-10-26 20:05:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19291 to 19286. [2018-10-26 20:05:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19286 states. [2018-10-26 20:05:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19286 states to 19286 states and 21819 transitions. [2018-10-26 20:05:27,633 INFO L78 Accepts]: Start accepts. Automaton has 19286 states and 21819 transitions. Word has length 230 [2018-10-26 20:05:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:27,634 INFO L481 AbstractCegarLoop]: Abstraction has 19286 states and 21819 transitions. [2018-10-26 20:05:27,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 19286 states and 21819 transitions. [2018-10-26 20:05:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 20:05:27,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:27,665 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:27,665 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:27,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash -68785608, now seen corresponding path program 1 times [2018-10-26 20:05:27,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:27,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:27,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:27,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:05:27,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:27,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:27,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:27,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:27,807 INFO L87 Difference]: Start difference. First operand 19286 states and 21819 transitions. Second operand 3 states. [2018-10-26 20:05:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:29,328 INFO L93 Difference]: Finished difference Result 43672 states and 49854 transitions. [2018-10-26 20:05:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:29,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-26 20:05:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:29,366 INFO L225 Difference]: With dead ends: 43672 [2018-10-26 20:05:29,366 INFO L226 Difference]: Without dead ends: 24388 [2018-10-26 20:05:29,385 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-26 20:05:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24388 states. [2018-10-26 20:05:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24388 to 24385. [2018-10-26 20:05:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24385 states. [2018-10-26 20:05:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24385 states to 24385 states and 26949 transitions. [2018-10-26 20:05:29,700 INFO L78 Accepts]: Start accepts. Automaton has 24385 states and 26949 transitions. Word has length 237 [2018-10-26 20:05:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:29,700 INFO L481 AbstractCegarLoop]: Abstraction has 24385 states and 26949 transitions. [2018-10-26 20:05:29,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 24385 states and 26949 transitions. [2018-10-26 20:05:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-26 20:05:29,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:29,725 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:29,725 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:29,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1345461011, now seen corresponding path program 1 times [2018-10-26 20:05:29,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:29,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:29,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:05:30,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:30,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:30,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:30,293 INFO L87 Difference]: Start difference. First operand 24385 states and 26949 transitions. Second operand 4 states. [2018-10-26 20:05:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:32,241 INFO L93 Difference]: Finished difference Result 48164 states and 53270 transitions. [2018-10-26 20:05:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:32,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2018-10-26 20:05:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:32,274 INFO L225 Difference]: With dead ends: 48164 [2018-10-26 20:05:32,274 INFO L226 Difference]: Without dead ends: 23781 [2018-10-26 20:05:32,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23781 states. [2018-10-26 20:05:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23781 to 23770. [2018-10-26 20:05:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23770 states. [2018-10-26 20:05:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23770 states to 23770 states and 26127 transitions. [2018-10-26 20:05:32,595 INFO L78 Accepts]: Start accepts. Automaton has 23770 states and 26127 transitions. Word has length 289 [2018-10-26 20:05:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:32,595 INFO L481 AbstractCegarLoop]: Abstraction has 23770 states and 26127 transitions. [2018-10-26 20:05:32,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 23770 states and 26127 transitions. [2018-10-26 20:05:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-26 20:05:32,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:32,617 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:32,618 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:32,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:32,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2113406810, now seen corresponding path program 1 times [2018-10-26 20:05:32,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:32,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:32,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:32,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 20:05:32,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:32,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:32,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:32,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:32,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:32,859 INFO L87 Difference]: Start difference. First operand 23770 states and 26127 transitions. Second operand 3 states. [2018-10-26 20:05:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:33,714 INFO L93 Difference]: Finished difference Result 47536 states and 52250 transitions. [2018-10-26 20:05:33,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:33,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-10-26 20:05:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:33,735 INFO L225 Difference]: With dead ends: 47536 [2018-10-26 20:05:33,735 INFO L226 Difference]: Without dead ends: 23768 [2018-10-26 20:05:33,751 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-26 20:05:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23768 states. [2018-10-26 20:05:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23768 to 23768. [2018-10-26 20:05:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23768 states. [2018-10-26 20:05:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23768 states to 23768 states and 26123 transitions. [2018-10-26 20:05:34,021 INFO L78 Accepts]: Start accepts. Automaton has 23768 states and 26123 transitions. Word has length 317 [2018-10-26 20:05:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:34,022 INFO L481 AbstractCegarLoop]: Abstraction has 23768 states and 26123 transitions. [2018-10-26 20:05:34,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 23768 states and 26123 transitions. [2018-10-26 20:05:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-26 20:05:34,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:34,042 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:34,042 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:34,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1833264674, now seen corresponding path program 1 times [2018-10-26 20:05:34,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:34,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:34,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 20:05:34,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:34,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:34,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:05:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:05:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:34,517 INFO L87 Difference]: Start difference. First operand 23768 states and 26123 transitions. Second operand 5 states. [2018-10-26 20:05:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:36,598 INFO L93 Difference]: Finished difference Result 66805 states and 73669 transitions. [2018-10-26 20:05:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:05:36,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2018-10-26 20:05:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:36,638 INFO L225 Difference]: With dead ends: 66805 [2018-10-26 20:05:36,638 INFO L226 Difference]: Without dead ends: 43039 [2018-10-26 20:05:36,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43039 states. [2018-10-26 20:05:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43039 to 41383. [2018-10-26 20:05:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41383 states. [2018-10-26 20:05:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41383 states to 41383 states and 45570 transitions. [2018-10-26 20:05:37,134 INFO L78 Accepts]: Start accepts. Automaton has 41383 states and 45570 transitions. Word has length 327 [2018-10-26 20:05:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:37,134 INFO L481 AbstractCegarLoop]: Abstraction has 41383 states and 45570 transitions. [2018-10-26 20:05:37,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:05:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 41383 states and 45570 transitions. [2018-10-26 20:05:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-26 20:05:37,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:37,156 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:37,157 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:37,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash -153782652, now seen corresponding path program 1 times [2018-10-26 20:05:37,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:37,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-26 20:05:37,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:37,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:37,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:37,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:37,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:37,555 INFO L87 Difference]: Start difference. First operand 41383 states and 45570 transitions. Second operand 4 states. [2018-10-26 20:05:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:39,855 INFO L93 Difference]: Finished difference Result 86252 states and 95150 transitions. [2018-10-26 20:05:39,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:39,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-10-26 20:05:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:39,906 INFO L225 Difference]: With dead ends: 86252 [2018-10-26 20:05:39,906 INFO L226 Difference]: Without dead ends: 44871 [2018-10-26 20:05:39,935 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-26 20:05:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44871 states. [2018-10-26 20:05:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44871 to 44860. [2018-10-26 20:05:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44860 states. [2018-10-26 20:05:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44860 states to 44860 states and 49424 transitions. [2018-10-26 20:05:40,462 INFO L78 Accepts]: Start accepts. Automaton has 44860 states and 49424 transitions. Word has length 333 [2018-10-26 20:05:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:40,462 INFO L481 AbstractCegarLoop]: Abstraction has 44860 states and 49424 transitions. [2018-10-26 20:05:40,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 44860 states and 49424 transitions. [2018-10-26 20:05:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-26 20:05:40,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:40,823 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:40,823 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:40,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:40,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1951369640, now seen corresponding path program 1 times [2018-10-26 20:05:40,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:40,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:40,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:40,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:40,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:41,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:41,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:41,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:41,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:41,304 INFO L87 Difference]: Start difference. First operand 44860 states and 49424 transitions. Second operand 3 states. [2018-10-26 20:05:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:42,888 INFO L93 Difference]: Finished difference Result 92984 states and 102537 transitions. [2018-10-26 20:05:42,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:42,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-26 20:05:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:42,941 INFO L225 Difference]: With dead ends: 92984 [2018-10-26 20:05:42,941 INFO L226 Difference]: Without dead ends: 48126 [2018-10-26 20:05:42,966 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-26 20:05:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48126 states. [2018-10-26 20:05:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48126 to 48124. [2018-10-26 20:05:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48124 states. [2018-10-26 20:05:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48124 states to 48124 states and 52868 transitions. [2018-10-26 20:05:43,420 INFO L78 Accepts]: Start accepts. Automaton has 48124 states and 52868 transitions. Word has length 348 [2018-10-26 20:05:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:43,420 INFO L481 AbstractCegarLoop]: Abstraction has 48124 states and 52868 transitions. [2018-10-26 20:05:43,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 48124 states and 52868 transitions. [2018-10-26 20:05:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-26 20:05:43,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:43,439 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:43,439 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:43,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1820103627, now seen corresponding path program 1 times [2018-10-26 20:05:43,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:43,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:43,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 20:05:43,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:43,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:43,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:43,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:43,953 INFO L87 Difference]: Start difference. First operand 48124 states and 52868 transitions. Second operand 4 states. [2018-10-26 20:05:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:45,986 INFO L93 Difference]: Finished difference Result 182061 states and 200055 transitions. [2018-10-26 20:05:45,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:45,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2018-10-26 20:05:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:46,131 INFO L225 Difference]: With dead ends: 182061 [2018-10-26 20:05:46,131 INFO L226 Difference]: Without dead ends: 133939 [2018-10-26 20:05:46,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133939 states. [2018-10-26 20:05:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133939 to 87246. [2018-10-26 20:05:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87246 states. [2018-10-26 20:05:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87246 states to 87246 states and 95790 transitions. [2018-10-26 20:05:47,763 INFO L78 Accepts]: Start accepts. Automaton has 87246 states and 95790 transitions. Word has length 361 [2018-10-26 20:05:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:47,764 INFO L481 AbstractCegarLoop]: Abstraction has 87246 states and 95790 transitions. [2018-10-26 20:05:47,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 87246 states and 95790 transitions. [2018-10-26 20:05:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-26 20:05:47,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:47,785 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:47,785 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:47,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash 582272980, now seen corresponding path program 1 times [2018-10-26 20:05:47,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:47,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:47,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 190 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 20:05:48,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:48,184 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-26 20:05:48,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:48,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:05:48,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:05:48,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 20:05:48,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:05:48,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:05:48,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:48,555 INFO L87 Difference]: Start difference. First operand 87246 states and 95790 transitions. Second operand 5 states. [2018-10-26 20:05:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:52,390 INFO L93 Difference]: Finished difference Result 166273 states and 182877 transitions. [2018-10-26 20:05:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:52,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 362 [2018-10-26 20:05:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:52,545 INFO L225 Difference]: With dead ends: 166273 [2018-10-26 20:05:52,545 INFO L226 Difference]: Without dead ends: 79029 [2018-10-26 20:05:52,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79029 states. [2018-10-26 20:05:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79029 to 77387. [2018-10-26 20:05:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77387 states. [2018-10-26 20:05:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77387 states to 77387 states and 84603 transitions. [2018-10-26 20:05:55,173 INFO L78 Accepts]: Start accepts. Automaton has 77387 states and 84603 transitions. Word has length 362 [2018-10-26 20:05:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:55,174 INFO L481 AbstractCegarLoop]: Abstraction has 77387 states and 84603 transitions. [2018-10-26 20:05:55,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:05:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 77387 states and 84603 transitions. [2018-10-26 20:05:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-26 20:05:55,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:55,235 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:55,236 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:55,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash 160490144, now seen corresponding path program 1 times [2018-10-26 20:05:55,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:55,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:55,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:55,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:55,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:55,738 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 20:05:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-10-26 20:05:55,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:55,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:55,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:55,898 INFO L87 Difference]: Start difference. First operand 77387 states and 84603 transitions. Second operand 4 states. [2018-10-26 20:06:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:00,667 INFO L93 Difference]: Finished difference Result 155194 states and 169699 transitions. [2018-10-26 20:06:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:00,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2018-10-26 20:06:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:00,773 INFO L225 Difference]: With dead ends: 155194 [2018-10-26 20:06:00,774 INFO L226 Difference]: Without dead ends: 77809 [2018-10-26 20:06:00,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77809 states. [2018-10-26 20:06:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77809 to 77180. [2018-10-26 20:06:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77180 states. [2018-10-26 20:06:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77180 states to 77180 states and 84249 transitions. [2018-10-26 20:06:02,752 INFO L78 Accepts]: Start accepts. Automaton has 77180 states and 84249 transitions. Word has length 398 [2018-10-26 20:06:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:02,752 INFO L481 AbstractCegarLoop]: Abstraction has 77180 states and 84249 transitions. [2018-10-26 20:06:02,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 77180 states and 84249 transitions. [2018-10-26 20:06:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-26 20:06:02,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:02,777 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:02,777 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:02,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash -90678840, now seen corresponding path program 1 times [2018-10-26 20:06:02,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:02,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:02,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-26 20:06:03,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:03,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:03,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:03,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:03,039 INFO L87 Difference]: Start difference. First operand 77180 states and 84249 transitions. Second operand 4 states. [2018-10-26 20:06:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:05,189 INFO L93 Difference]: Finished difference Result 219412 states and 238730 transitions. [2018-10-26 20:06:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:05,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 404 [2018-10-26 20:06:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:05,373 INFO L225 Difference]: With dead ends: 219412 [2018-10-26 20:06:05,373 INFO L226 Difference]: Without dead ends: 142234 [2018-10-26 20:06:05,440 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-26 20:06:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142234 states. [2018-10-26 20:06:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142234 to 140382. [2018-10-26 20:06:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140382 states. [2018-10-26 20:06:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140382 states to 140382 states and 152503 transitions. [2018-10-26 20:06:08,447 INFO L78 Accepts]: Start accepts. Automaton has 140382 states and 152503 transitions. Word has length 404 [2018-10-26 20:06:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:08,447 INFO L481 AbstractCegarLoop]: Abstraction has 140382 states and 152503 transitions. [2018-10-26 20:06:08,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 140382 states and 152503 transitions. [2018-10-26 20:06:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-26 20:06:08,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:08,479 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-26 20:06:08,479 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:08,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1911073964, now seen corresponding path program 1 times [2018-10-26 20:06:08,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-10-26 20:06:08,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:08,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:06:08,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:06:08,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:06:08,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:06:08,876 INFO L87 Difference]: Start difference. First operand 140382 states and 152503 transitions. Second operand 5 states. [2018-10-26 20:06:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:12,093 INFO L93 Difference]: Finished difference Result 370715 states and 401650 transitions. [2018-10-26 20:06:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:06:12,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 416 [2018-10-26 20:06:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:12,403 INFO L225 Difference]: With dead ends: 370715 [2018-10-26 20:06:12,403 INFO L226 Difference]: Without dead ends: 230539 [2018-10-26 20:06:12,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:06:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230539 states. [2018-10-26 20:06:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230539 to 222349. [2018-10-26 20:06:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222349 states. [2018-10-26 20:06:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222349 states to 222349 states and 240055 transitions. [2018-10-26 20:06:16,529 INFO L78 Accepts]: Start accepts. Automaton has 222349 states and 240055 transitions. Word has length 416 [2018-10-26 20:06:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:16,529 INFO L481 AbstractCegarLoop]: Abstraction has 222349 states and 240055 transitions. [2018-10-26 20:06:16,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:06:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 222349 states and 240055 transitions. [2018-10-26 20:06:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-26 20:06:16,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:16,564 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:06:16,564 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:16,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash -202726217, now seen corresponding path program 1 times [2018-10-26 20:06:16,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:16,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:16,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:17,006 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:06:17,317 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 20:06:17,557 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 20:06:18,119 WARN L179 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-26 20:06:18,487 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-26 20:06:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 267 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:23,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:23,653 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:06:23,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:23,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 20:06:24,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:06:24,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2018-10-26 20:06:24,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 20:06:24,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 20:06:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:06:24,327 INFO L87 Difference]: Start difference. First operand 222349 states and 240055 transitions. Second operand 16 states. [2018-10-26 20:06:25,450 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2018-10-26 20:06:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:53,268 INFO L93 Difference]: Finished difference Result 847090 states and 914358 transitions. [2018-10-26 20:06:53,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-26 20:06:53,269 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 421 [2018-10-26 20:06:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:55,067 INFO L225 Difference]: With dead ends: 847090 [2018-10-26 20:06:55,068 INFO L226 Difference]: Without dead ends: 624947 [2018-10-26 20:06:55,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3196 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1646, Invalid=6726, Unknown=0, NotChecked=0, Total=8372 [2018-10-26 20:06:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624947 states. [2018-10-26 20:07:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624947 to 458440. [2018-10-26 20:07:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458440 states. [2018-10-26 20:07:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458440 states to 458440 states and 493938 transitions. [2018-10-26 20:07:03,100 INFO L78 Accepts]: Start accepts. Automaton has 458440 states and 493938 transitions. Word has length 421 [2018-10-26 20:07:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:03,101 INFO L481 AbstractCegarLoop]: Abstraction has 458440 states and 493938 transitions. [2018-10-26 20:07:03,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 20:07:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 458440 states and 493938 transitions. [2018-10-26 20:07:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-10-26 20:07:03,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:03,166 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:07:03,166 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:03,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:03,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1819457701, now seen corresponding path program 1 times [2018-10-26 20:07:03,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:03,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:03,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:03,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:03,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 20:07:05,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:05,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:07:05,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:07:05,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:07:05,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:05,071 INFO L87 Difference]: Start difference. First operand 458440 states and 493938 transitions. Second operand 4 states. [2018-10-26 20:07:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:11,783 INFO L93 Difference]: Finished difference Result 920163 states and 991305 transitions. [2018-10-26 20:07:11,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:11,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 461 [2018-10-26 20:07:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:12,327 INFO L225 Difference]: With dead ends: 920163 [2018-10-26 20:07:12,327 INFO L226 Difference]: Without dead ends: 461929 [2018-10-26 20:07:12,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461929 states. [2018-10-26 20:07:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461929 to 456399. [2018-10-26 20:07:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456399 states. [2018-10-26 20:07:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456399 states to 456399 states and 490645 transitions. [2018-10-26 20:07:27,600 INFO L78 Accepts]: Start accepts. Automaton has 456399 states and 490645 transitions. Word has length 461 [2018-10-26 20:07:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:27,600 INFO L481 AbstractCegarLoop]: Abstraction has 456399 states and 490645 transitions. [2018-10-26 20:07:27,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 456399 states and 490645 transitions. [2018-10-26 20:07:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-10-26 20:07:27,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:27,677 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:27,677 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:27,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash 873961078, now seen corresponding path program 1 times [2018-10-26 20:07:27,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:27,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:27,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:28,118 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:07:28,315 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:07:28,642 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-26 20:07:28,858 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2018-10-26 20:07:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 392 proven. 36 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 20:07:30,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:07:30,317 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:07:30,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:30,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-26 20:07:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:07:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-26 20:07:30,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:07:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:07:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:07:30,921 INFO L87 Difference]: Start difference. First operand 456399 states and 490645 transitions. Second operand 11 states. [2018-10-26 20:07:31,517 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 20:07:53,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:53,920 INFO L93 Difference]: Finished difference Result 2033014 states and 2186882 transitions. [2018-10-26 20:07:53,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 20:07:53,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 485 [2018-10-26 20:07:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:56,318 INFO L225 Difference]: With dead ends: 2033014 [2018-10-26 20:07:56,319 INFO L226 Difference]: Without dead ends: 1576817 [2018-10-26 20:07:56,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2018-10-26 20:07:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576817 states. Received shutdown request... [2018-10-26 20:08:14,561 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:08:14,566 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:08:14,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:08:14 BoogieIcfgContainer [2018-10-26 20:08:14,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:08:14,567 INFO L168 Benchmark]: Toolchain (without parser) took 203119.79 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.1 GB). Free memory was 1.4 GB in the beginning and 4.6 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. [2018-10-26 20:08:14,568 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:08:14,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1091.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:08:14,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 392.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -885.3 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-26 20:08:14,570 INFO L168 Benchmark]: Boogie Preprocessor took 164.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-10-26 20:08:14,571 INFO L168 Benchmark]: RCFGBuilder took 5460.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 250.2 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. [2018-10-26 20:08:14,572 INFO L168 Benchmark]: TraceAbstraction took 196000.89 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 2.0 GB in the beginning and 4.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.6 GB. Max. memory is 7.1 GB. [2018-10-26 20:08:14,576 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1091.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 392.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -885.3 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 164.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5460.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 250.2 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196000.89 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 2.0 GB in the beginning and 4.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1566]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1566). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 195.9s OverallTime, 23 OverallIterations, 6 TraceHistogramMax, 116.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5678 SDtfs, 30679 SDslu, 5398 SDs, 0 SdLazy, 42912 SolverSat, 7134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1693 GetRequests, 1533 SyntacticMatches, 6 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3300 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458440occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 57.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 235164 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 8480 NumberOfCodeBlocks, 8480 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 8453 ConstructedInterpolants, 0 QuantifiedInterpolants, 9697552 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2496 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 5714/5942 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown