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/Problem11_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 19:59:59,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 19:59:59,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 19:59:59,427 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 19:59:59,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 19:59:59,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 19:59:59,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 19:59:59,434 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 19:59:59,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 19:59:59,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 19:59:59,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 19:59:59,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 19:59:59,442 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 19:59:59,443 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 19:59:59,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 19:59:59,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 19:59:59,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 19:59:59,459 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 19:59:59,461 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 19:59:59,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 19:59:59,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 19:59:59,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 19:59:59,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 19:59:59,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 19:59:59,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 19:59:59,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 19:59:59,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 19:59:59,475 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 19:59:59,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 19:59:59,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 19:59:59,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 19:59:59,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 19:59:59,480 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 19:59:59,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 19:59:59,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 19:59:59,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 19:59:59,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 19:59:59,511 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 19:59:59,511 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 19:59:59,512 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 19:59:59,512 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 19:59:59,513 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 19:59:59,514 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 19:59:59,514 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 19:59:59,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 19:59:59,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 19:59:59,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 19:59:59,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 19:59:59,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 19:59:59,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 19:59:59,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 19:59:59,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 19:59:59,516 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 19:59:59,517 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 19:59:59,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 19:59:59,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 19:59:59,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 19:59:59,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 19:59:59,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 19:59:59,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 19:59:59,518 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 19:59:59,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 19:59:59,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 19:59:59,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 19:59:59,519 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 19:59:59,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 19:59:59,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 19:59:59,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 19:59:59,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 19:59:59,594 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 19:59:59,595 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label11_true-unreach-call.c [2018-10-23 19:59:59,672 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e5ada7a5f/668e7f78ac5f40cf83cf48d8d5f8c94b/FLAGa5a514a5f [2018-10-23 20:00:00,358 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:00:00,359 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label11_true-unreach-call.c [2018-10-23 20:00:00,377 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e5ada7a5f/668e7f78ac5f40cf83cf48d8d5f8c94b/FLAGa5a514a5f [2018-10-23 20:00:00,398 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e5ada7a5f/668e7f78ac5f40cf83cf48d8d5f8c94b [2018-10-23 20:00:00,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:00:00,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:00:00,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:00:00,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:00:00,420 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:00:00,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:00:00" (1/1) ... [2018-10-23 20:00:00,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e7fca2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:00, skipping insertion in model container [2018-10-23 20:00:00,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:00:00" (1/1) ... [2018-10-23 20:00:00,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:00:00,514 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:00:01,228 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:00:01,233 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:00:01,461 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:00:01,480 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:00:01,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01 WrapperNode [2018-10-23 20:00:01,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:00:01,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:00:01,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:00:01,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:00:01,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:00:01,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:00:01,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:00:01,775 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:00:01,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... [2018-10-23 20:00:01,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:00:01,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:00:01,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:00:01,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:00:01,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:00:01,976 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:00:01,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:00:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:00:06,362 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:00:06,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:00:06 BoogieIcfgContainer [2018-10-23 20:00:06,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:00:06,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:00:06,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:00:06,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:00:06,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:00:00" (1/3) ... [2018-10-23 20:00:06,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e1fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:00:06, skipping insertion in model container [2018-10-23 20:00:06,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:01" (2/3) ... [2018-10-23 20:00:06,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e1fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:00:06, skipping insertion in model container [2018-10-23 20:00:06,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:00:06" (3/3) ... [2018-10-23 20:00:06,373 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label11_true-unreach-call.c [2018-10-23 20:00:06,384 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:00:06,393 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:00:06,411 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:00:06,449 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:00:06,450 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:00:06,450 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:00:06,450 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:00:06,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:00:06,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:00:06,451 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:00:06,451 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:00:06,451 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:00:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-23 20:00:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-23 20:00:06,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:06,488 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] [2018-10-23 20:00:06,491 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:06,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1515441142, now seen corresponding path program 1 times [2018-10-23 20:00:06,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:06,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:06,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:00:07,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:07,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:00:07,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:00:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:00:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:07,047 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-23 20:00:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:10,219 INFO L93 Difference]: Finished difference Result 961 states and 1728 transitions. [2018-10-23 20:00:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:00:10,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-23 20:00:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:10,246 INFO L225 Difference]: With dead ends: 961 [2018-10-23 20:00:10,247 INFO L226 Difference]: Without dead ends: 670 [2018-10-23 20:00:10,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-23 20:00:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-10-23 20:00:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-10-23 20:00:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1024 transitions. [2018-10-23 20:00:10,346 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1024 transitions. Word has length 62 [2018-10-23 20:00:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:10,347 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 1024 transitions. [2018-10-23 20:00:10,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:00:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1024 transitions. [2018-10-23 20:00:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-23 20:00:10,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:10,357 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:00:10,357 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:10,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash 439607983, now seen corresponding path program 1 times [2018-10-23 20:00:10,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:10,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:10,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:00:10,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:10,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:00:10,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:00:10,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:00:10,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:10,666 INFO L87 Difference]: Start difference. First operand 670 states and 1024 transitions. Second operand 4 states. [2018-10-23 20:00:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:15,315 INFO L93 Difference]: Finished difference Result 2478 states and 3869 transitions. [2018-10-23 20:00:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:00:15,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-10-23 20:00:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:15,332 INFO L225 Difference]: With dead ends: 2478 [2018-10-23 20:00:15,333 INFO L226 Difference]: Without dead ends: 1810 [2018-10-23 20:00:15,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2018-10-23 20:00:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1226. [2018-10-23 20:00:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-10-23 20:00:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1709 transitions. [2018-10-23 20:00:15,419 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1709 transitions. Word has length 139 [2018-10-23 20:00:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:15,420 INFO L481 AbstractCegarLoop]: Abstraction has 1226 states and 1709 transitions. [2018-10-23 20:00:15,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:00:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1709 transitions. [2018-10-23 20:00:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-23 20:00:15,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:15,437 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:00:15,438 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:15,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1794831649, now seen corresponding path program 1 times [2018-10-23 20:00:15,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:15,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:15,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:15,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:00:15,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:15,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:00:15,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:00:15,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:00:15,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:15,826 INFO L87 Difference]: Start difference. First operand 1226 states and 1709 transitions. Second operand 4 states. [2018-10-23 20:00:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:18,587 INFO L93 Difference]: Finished difference Result 4138 states and 5963 transitions. [2018-10-23 20:00:18,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:00:18,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-10-23 20:00:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:18,604 INFO L225 Difference]: With dead ends: 4138 [2018-10-23 20:00:18,604 INFO L226 Difference]: Without dead ends: 2914 [2018-10-23 20:00:18,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2018-10-23 20:00:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2151. [2018-10-23 20:00:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2018-10-23 20:00:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 2800 transitions. [2018-10-23 20:00:18,657 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 2800 transitions. Word has length 190 [2018-10-23 20:00:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:18,658 INFO L481 AbstractCegarLoop]: Abstraction has 2151 states and 2800 transitions. [2018-10-23 20:00:18,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:00:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2800 transitions. [2018-10-23 20:00:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-23 20:00:18,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:18,662 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:00:18,662 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:18,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1441746538, now seen corresponding path program 1 times [2018-10-23 20:00:18,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:18,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:18,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:18,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:18,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-23 20:00:18,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:18,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:00:18,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:00:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:00:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:18,877 INFO L87 Difference]: Start difference. First operand 2151 states and 2800 transitions. Second operand 4 states. [2018-10-23 20:00:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:26,165 INFO L93 Difference]: Finished difference Result 7462 states and 9948 transitions. [2018-10-23 20:00:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:00:26,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-10-23 20:00:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:26,191 INFO L225 Difference]: With dead ends: 7462 [2018-10-23 20:00:26,191 INFO L226 Difference]: Without dead ends: 5313 [2018-10-23 20:00:26,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2018-10-23 20:00:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5111. [2018-10-23 20:00:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5111 states. [2018-10-23 20:00:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5111 states to 5111 states and 6491 transitions. [2018-10-23 20:00:26,294 INFO L78 Accepts]: Start accepts. Automaton has 5111 states and 6491 transitions. Word has length 208 [2018-10-23 20:00:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:26,294 INFO L481 AbstractCegarLoop]: Abstraction has 5111 states and 6491 transitions. [2018-10-23 20:00:26,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:00:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5111 states and 6491 transitions. [2018-10-23 20:00:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-23 20:00:26,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:26,303 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, 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-23 20:00:26,303 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:26,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:26,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1315185902, now seen corresponding path program 1 times [2018-10-23 20:00:26,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:26,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-23 20:00:26,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:26,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:00:26,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:00:26,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:00:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:26,552 INFO L87 Difference]: Start difference. First operand 5111 states and 6491 transitions. Second operand 3 states. [2018-10-23 20:00:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:28,788 INFO L93 Difference]: Finished difference Result 11883 states and 15322 transitions. [2018-10-23 20:00:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:00:28,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2018-10-23 20:00:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:28,816 INFO L225 Difference]: With dead ends: 11883 [2018-10-23 20:00:28,816 INFO L226 Difference]: Without dead ends: 6959 [2018-10-23 20:00:28,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2018-10-23 20:00:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6959. [2018-10-23 20:00:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6959 states. [2018-10-23 20:00:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 8768 transitions. [2018-10-23 20:00:28,929 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 8768 transitions. Word has length 252 [2018-10-23 20:00:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:28,930 INFO L481 AbstractCegarLoop]: Abstraction has 6959 states and 8768 transitions. [2018-10-23 20:00:28,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:00:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 8768 transitions. [2018-10-23 20:00:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-23 20:00:28,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:28,939 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, 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] [2018-10-23 20:00:28,939 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:28,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 484844517, now seen corresponding path program 1 times [2018-10-23 20:00:28,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:28,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:28,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:28,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:28,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:29,553 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-23 20:00:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:00:29,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:29,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:00:29,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:00:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:00:29,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:29,618 INFO L87 Difference]: Start difference. First operand 6959 states and 8768 transitions. Second operand 4 states. [2018-10-23 20:00:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:32,883 INFO L93 Difference]: Finished difference Result 18185 states and 23270 transitions. [2018-10-23 20:00:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:00:32,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2018-10-23 20:00:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:32,932 INFO L225 Difference]: With dead ends: 18185 [2018-10-23 20:00:32,932 INFO L226 Difference]: Without dead ends: 11413 [2018-10-23 20:00:32,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11413 states. [2018-10-23 20:00:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11413 to 11029. [2018-10-23 20:00:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11029 states. [2018-10-23 20:00:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11029 states to 11029 states and 13573 transitions. [2018-10-23 20:00:33,141 INFO L78 Accepts]: Start accepts. Automaton has 11029 states and 13573 transitions. Word has length 268 [2018-10-23 20:00:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:33,142 INFO L481 AbstractCegarLoop]: Abstraction has 11029 states and 13573 transitions. [2018-10-23 20:00:33,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:00:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 11029 states and 13573 transitions. [2018-10-23 20:00:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-23 20:00:33,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:33,164 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:00:33,164 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:33,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:33,164 INFO L82 PathProgramCache]: Analyzing trace with hash 955286133, now seen corresponding path program 1 times [2018-10-23 20:00:33,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:33,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:33,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:33,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:33,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-23 20:00:33,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:33,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:00:33,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:00:33,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:00:33,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:33,544 INFO L87 Difference]: Start difference. First operand 11029 states and 13573 transitions. Second operand 3 states. [2018-10-23 20:00:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:34,750 INFO L93 Difference]: Finished difference Result 21499 states and 26551 transitions. [2018-10-23 20:00:34,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:00:34,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2018-10-23 20:00:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:34,771 INFO L225 Difference]: With dead ends: 21499 [2018-10-23 20:00:34,771 INFO L226 Difference]: Without dead ends: 10657 [2018-10-23 20:00:34,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10657 states. [2018-10-23 20:00:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10657 to 10656. [2018-10-23 20:00:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10656 states. [2018-10-23 20:00:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10656 states to 10656 states and 12526 transitions. [2018-10-23 20:00:34,922 INFO L78 Accepts]: Start accepts. Automaton has 10656 states and 12526 transitions. Word has length 344 [2018-10-23 20:00:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:34,923 INFO L481 AbstractCegarLoop]: Abstraction has 10656 states and 12526 transitions. [2018-10-23 20:00:34,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:00:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 10656 states and 12526 transitions. [2018-10-23 20:00:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-23 20:00:34,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:34,942 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:00:34,943 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:34,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1928196445, now seen corresponding path program 1 times [2018-10-23 20:00:34,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:34,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:34,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:34,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-10-23 20:00:35,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:35,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:00:35,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:00:35,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:00:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:35,249 INFO L87 Difference]: Start difference. First operand 10656 states and 12526 transitions. Second operand 3 states. [2018-10-23 20:00:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:38,375 INFO L93 Difference]: Finished difference Result 23532 states and 27910 transitions. [2018-10-23 20:00:38,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:00:38,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-23 20:00:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:38,404 INFO L225 Difference]: With dead ends: 23532 [2018-10-23 20:00:38,404 INFO L226 Difference]: Without dead ends: 13063 [2018-10-23 20:00:38,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13063 states. [2018-10-23 20:00:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13063 to 12690. [2018-10-23 20:00:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12690 states. [2018-10-23 20:00:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12690 states to 12690 states and 14657 transitions. [2018-10-23 20:00:38,560 INFO L78 Accepts]: Start accepts. Automaton has 12690 states and 14657 transitions. Word has length 347 [2018-10-23 20:00:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:38,561 INFO L481 AbstractCegarLoop]: Abstraction has 12690 states and 14657 transitions. [2018-10-23 20:00:38,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:00:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 12690 states and 14657 transitions. [2018-10-23 20:00:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-23 20:00:38,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:38,587 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:00:38,588 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:38,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1873371516, now seen corresponding path program 1 times [2018-10-23 20:00:38,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:38,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:38,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-23 20:00:39,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:39,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:00:39,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:00:39,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:00:39,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:39,036 INFO L87 Difference]: Start difference. First operand 12690 states and 14657 transitions. Second operand 3 states. [2018-10-23 20:00:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:40,453 INFO L93 Difference]: Finished difference Result 27782 states and 32238 transitions. [2018-10-23 20:00:40,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:00:40,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2018-10-23 20:00:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:40,481 INFO L225 Difference]: With dead ends: 27782 [2018-10-23 20:00:40,482 INFO L226 Difference]: Without dead ends: 14535 [2018-10-23 20:00:40,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14535 states. [2018-10-23 20:00:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14535 to 13795. [2018-10-23 20:00:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13795 states. [2018-10-23 20:00:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13795 states to 13795 states and 15682 transitions. [2018-10-23 20:00:40,664 INFO L78 Accepts]: Start accepts. Automaton has 13795 states and 15682 transitions. Word has length 400 [2018-10-23 20:00:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:40,665 INFO L481 AbstractCegarLoop]: Abstraction has 13795 states and 15682 transitions. [2018-10-23 20:00:40,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:00:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 13795 states and 15682 transitions. [2018-10-23 20:00:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-23 20:00:40,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:40,689 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:00:40,689 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:40,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash 838140476, now seen corresponding path program 1 times [2018-10-23 20:00:40,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:40,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:40,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 331 proven. 103 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-23 20:00:41,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:00:41,291 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:00:41,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:41,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:00:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 331 proven. 103 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-23 20:00:41,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:00:41,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-23 20:00:41,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:00:41,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:00:41,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:00:41,897 INFO L87 Difference]: Start difference. First operand 13795 states and 15682 transitions. Second operand 5 states. [2018-10-23 20:00:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:48,837 INFO L93 Difference]: Finished difference Result 33722 states and 38667 transitions. [2018-10-23 20:00:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 20:00:48,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-10-23 20:00:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:48,870 INFO L225 Difference]: With dead ends: 33722 [2018-10-23 20:00:48,870 INFO L226 Difference]: Without dead ends: 20114 [2018-10-23 20:00:48,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:00:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20114 states. [2018-10-23 20:00:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20114 to 14159. [2018-10-23 20:00:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14159 states. [2018-10-23 20:00:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14159 states to 14159 states and 16088 transitions. [2018-10-23 20:00:49,101 INFO L78 Accepts]: Start accepts. Automaton has 14159 states and 16088 transitions. Word has length 405 [2018-10-23 20:00:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:49,102 INFO L481 AbstractCegarLoop]: Abstraction has 14159 states and 16088 transitions. [2018-10-23 20:00:49,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:00:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 14159 states and 16088 transitions. [2018-10-23 20:00:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-23 20:00:49,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:49,130 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:00:49,130 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:49,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash 494281356, now seen corresponding path program 1 times [2018-10-23 20:00:49,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:49,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:49,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-23 20:00:49,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:49,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:00:49,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:00:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:00:49,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:00:49,800 INFO L87 Difference]: Start difference. First operand 14159 states and 16088 transitions. Second operand 5 states. [2018-10-23 20:00:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:53,471 INFO L93 Difference]: Finished difference Result 35358 states and 40264 transitions. [2018-10-23 20:00:53,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:00:53,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 414 [2018-10-23 20:00:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:53,491 INFO L225 Difference]: With dead ends: 35358 [2018-10-23 20:00:53,491 INFO L226 Difference]: Without dead ends: 20646 [2018-10-23 20:00:53,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:00:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20646 states. [2018-10-23 20:00:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20646 to 19166. [2018-10-23 20:00:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19166 states. [2018-10-23 20:00:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19166 states to 19166 states and 21810 transitions. [2018-10-23 20:00:53,741 INFO L78 Accepts]: Start accepts. Automaton has 19166 states and 21810 transitions. Word has length 414 [2018-10-23 20:00:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:53,742 INFO L481 AbstractCegarLoop]: Abstraction has 19166 states and 21810 transitions. [2018-10-23 20:00:53,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:00:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 19166 states and 21810 transitions. [2018-10-23 20:00:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-23 20:00:53,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:53,776 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-23 20:00:53,776 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:53,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1286239209, now seen corresponding path program 1 times [2018-10-23 20:00:53,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:53,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:53,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:53,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:53,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-10-23 20:00:54,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:54,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 20:00:54,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:00:54,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:00:54,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:54,326 INFO L87 Difference]: Start difference. First operand 19166 states and 21810 transitions. Second operand 3 states. [2018-10-23 20:00:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:55,177 INFO L93 Difference]: Finished difference Result 35175 states and 40002 transitions. [2018-10-23 20:00:55,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:00:55,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-10-23 20:00:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:55,193 INFO L225 Difference]: With dead ends: 35175 [2018-10-23 20:00:55,194 INFO L226 Difference]: Without dead ends: 18421 [2018-10-23 20:00:55,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:00:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2018-10-23 20:00:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 18421. [2018-10-23 20:00:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18421 states. [2018-10-23 20:00:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18421 states to 18421 states and 20880 transitions. [2018-10-23 20:00:55,407 INFO L78 Accepts]: Start accepts. Automaton has 18421 states and 20880 transitions. Word has length 440 [2018-10-23 20:00:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:55,408 INFO L481 AbstractCegarLoop]: Abstraction has 18421 states and 20880 transitions. [2018-10-23 20:00:55,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:00:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 18421 states and 20880 transitions. [2018-10-23 20:00:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-23 20:00:55,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:55,437 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:00:55,438 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:55,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:55,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2047885097, now seen corresponding path program 1 times [2018-10-23 20:00:55,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:55,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:55,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:55,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:55,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:56,066 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-23 20:00:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-23 20:00:56,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:56,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:00:56,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:00:56,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:00:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:56,190 INFO L87 Difference]: Start difference. First operand 18421 states and 20880 transitions. Second operand 4 states. [2018-10-23 20:00:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:00:58,107 INFO L93 Difference]: Finished difference Result 37225 states and 42209 transitions. [2018-10-23 20:00:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:00:58,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-10-23 20:00:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:00:58,126 INFO L225 Difference]: With dead ends: 37225 [2018-10-23 20:00:58,127 INFO L226 Difference]: Without dead ends: 18991 [2018-10-23 20:00:58,139 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-23 20:00:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18991 states. [2018-10-23 20:00:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18991 to 18419. [2018-10-23 20:00:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18419 states. [2018-10-23 20:00:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18419 states to 18419 states and 20442 transitions. [2018-10-23 20:00:58,346 INFO L78 Accepts]: Start accepts. Automaton has 18419 states and 20442 transitions. Word has length 505 [2018-10-23 20:00:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:00:58,347 INFO L481 AbstractCegarLoop]: Abstraction has 18419 states and 20442 transitions. [2018-10-23 20:00:58,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:00:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18419 states and 20442 transitions. [2018-10-23 20:00:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-10-23 20:00:58,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:58,372 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:00:58,372 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:58,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1718702583, now seen corresponding path program 1 times [2018-10-23 20:00:58,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:58,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:58,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 454 proven. 111 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-23 20:00:59,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:00:59,784 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:00:59,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:59,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:01:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 348 proven. 457 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-23 20:01:01,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:01:01,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-23 20:01:01,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:01:01,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:01:01,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:01:01,256 INFO L87 Difference]: Start difference. First operand 18419 states and 20442 transitions. Second operand 9 states. [2018-10-23 20:01:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:12,517 INFO L93 Difference]: Finished difference Result 49717 states and 55185 transitions. [2018-10-23 20:01:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-23 20:01:12,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 576 [2018-10-23 20:01:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:12,552 INFO L225 Difference]: With dead ends: 49717 [2018-10-23 20:01:12,552 INFO L226 Difference]: Without dead ends: 30741 [2018-10-23 20:01:12,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-10-23 20:01:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30741 states. [2018-10-23 20:01:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30741 to 28049. [2018-10-23 20:01:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28049 states. [2018-10-23 20:01:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28049 states to 28049 states and 31182 transitions. [2018-10-23 20:01:12,904 INFO L78 Accepts]: Start accepts. Automaton has 28049 states and 31182 transitions. Word has length 576 [2018-10-23 20:01:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:12,904 INFO L481 AbstractCegarLoop]: Abstraction has 28049 states and 31182 transitions. [2018-10-23 20:01:12,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:01:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28049 states and 31182 transitions. [2018-10-23 20:01:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-10-23 20:01:12,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:12,925 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-23 20:01:12,926 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:12,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash 507591029, now seen corresponding path program 1 times [2018-10-23 20:01:12,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:12,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2018-10-23 20:01:13,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:13,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:01:13,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:01:13,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:01:13,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:01:13,580 INFO L87 Difference]: Start difference. First operand 28049 states and 31182 transitions. Second operand 3 states. [2018-10-23 20:01:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:14,768 INFO L93 Difference]: Finished difference Result 57201 states and 63569 transitions. [2018-10-23 20:01:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:01:14,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 588 [2018-10-23 20:01:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:14,795 INFO L225 Difference]: With dead ends: 57201 [2018-10-23 20:01:14,796 INFO L226 Difference]: Without dead ends: 27284 [2018-10-23 20:01:14,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:01:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27284 states. [2018-10-23 20:01:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27284 to 27099. [2018-10-23 20:01:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27099 states. [2018-10-23 20:01:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27099 states to 27099 states and 29577 transitions. [2018-10-23 20:01:15,078 INFO L78 Accepts]: Start accepts. Automaton has 27099 states and 29577 transitions. Word has length 588 [2018-10-23 20:01:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:15,078 INFO L481 AbstractCegarLoop]: Abstraction has 27099 states and 29577 transitions. [2018-10-23 20:01:15,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:01:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 27099 states and 29577 transitions. [2018-10-23 20:01:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-10-23 20:01:15,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:15,098 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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] [2018-10-23 20:01:15,099 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:15,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash -991108154, now seen corresponding path program 1 times [2018-10-23 20:01:15,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:15,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:15,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:15,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:16,093 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-23 20:01:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 595 proven. 368 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-10-23 20:01:17,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:01:17,051 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:01:17,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:17,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:01:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 653 proven. 24 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2018-10-23 20:01:18,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:01:18,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-10-23 20:01:18,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 20:01:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 20:01:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-23 20:01:18,388 INFO L87 Difference]: Start difference. First operand 27099 states and 29577 transitions. Second operand 10 states. [2018-10-23 20:01:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:22,670 INFO L93 Difference]: Finished difference Result 52820 states and 57592 transitions. [2018-10-23 20:01:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 20:01:22,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 596 [2018-10-23 20:01:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:22,698 INFO L225 Difference]: With dead ends: 52820 [2018-10-23 20:01:22,699 INFO L226 Difference]: Without dead ends: 27760 [2018-10-23 20:01:22,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 594 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-10-23 20:01:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27760 states. [2018-10-23 20:01:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27760 to 27099. [2018-10-23 20:01:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27099 states. [2018-10-23 20:01:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27099 states to 27099 states and 29571 transitions. [2018-10-23 20:01:22,990 INFO L78 Accepts]: Start accepts. Automaton has 27099 states and 29571 transitions. Word has length 596 [2018-10-23 20:01:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:22,990 INFO L481 AbstractCegarLoop]: Abstraction has 27099 states and 29571 transitions. [2018-10-23 20:01:22,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 20:01:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27099 states and 29571 transitions. [2018-10-23 20:01:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-10-23 20:01:23,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:23,012 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-10-23 20:01:23,012 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:23,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:23,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1927532272, now seen corresponding path program 1 times [2018-10-23 20:01:23,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:23,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:23,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:23,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:23,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1090 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2018-10-23 20:01:24,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:24,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:01:24,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:01:24,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:01:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:24,422 INFO L87 Difference]: Start difference. First operand 27099 states and 29571 transitions. Second operand 5 states. [2018-10-23 20:01:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:26,455 INFO L93 Difference]: Finished difference Result 53646 states and 58631 transitions. [2018-10-23 20:01:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:01:26,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 799 [2018-10-23 20:01:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:26,484 INFO L225 Difference]: With dead ends: 53646 [2018-10-23 20:01:26,484 INFO L226 Difference]: Without dead ends: 26734 [2018-10-23 20:01:26,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26734 states. [2018-10-23 20:01:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26734 to 23763. [2018-10-23 20:01:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23763 states. [2018-10-23 20:01:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23763 states to 23763 states and 25456 transitions. [2018-10-23 20:01:26,717 INFO L78 Accepts]: Start accepts. Automaton has 23763 states and 25456 transitions. Word has length 799 [2018-10-23 20:01:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:26,718 INFO L481 AbstractCegarLoop]: Abstraction has 23763 states and 25456 transitions. [2018-10-23 20:01:26,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:01:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23763 states and 25456 transitions. [2018-10-23 20:01:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2018-10-23 20:01:26,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:26,735 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:01:26,735 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:26,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:26,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1966311317, now seen corresponding path program 1 times [2018-10-23 20:01:26,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:26,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:27,385 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 20:01:27,648 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-10-23 20:01:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2497 backedges. 1145 proven. 112 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-23 20:01:29,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:01:29,199 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:01:29,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:29,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:01:39,844 WARN L179 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-10-23 20:01:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2497 backedges. 1498 proven. 409 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2018-10-23 20:01:42,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:01:42,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-10-23 20:01:42,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-23 20:01:42,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-23 20:01:42,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=120, Unknown=1, NotChecked=0, Total=156 [2018-10-23 20:01:42,228 INFO L87 Difference]: Start difference. First operand 23763 states and 25456 transitions. Second operand 13 states. Received shutdown request... [2018-10-23 20:04:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:04:09,221 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 20:04:09,226 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 20:04:09,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:04:09 BoogieIcfgContainer [2018-10-23 20:04:09,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 20:04:09,229 INFO L168 Benchmark]: Toolchain (without parser) took 248816.55 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 721.8 MB. Max. memory is 7.1 GB. [2018-10-23 20:04:09,230 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 20:04:09,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1067.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-23 20:04:09,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 292.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2018-10-23 20:04:09,236 INFO L168 Benchmark]: Boogie Preprocessor took 131.67 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 20:04:09,236 INFO L168 Benchmark]: RCFGBuilder took 4457.22 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: 197.2 MB). Peak memory consumption was 197.2 MB. Max. memory is 7.1 GB. [2018-10-23 20:04:09,238 INFO L168 Benchmark]: TraceAbstraction took 242862.52 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 553.8 MB. Max. memory is 7.1 GB. [2018-10-23 20:04:09,244 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.27 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 1067.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 292.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.67 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4457.22 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: 197.2 MB). Peak memory consumption was 197.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242862.52 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 553.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 189]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 189). Cancelled while BasicCegarLoop was constructing difference of abstraction (23763states) and FLOYD_HOARE automaton (currently 3 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 242.7s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 208.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3960 SDtfs, 8964 SDslu, 1812 SDs, 0 SdLazy, 21818 SolverSat, 4475 SolverUnsat, 74 SolverUnknown, 0 SolverNotchecked, 196.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2543 GetRequests, 2458 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28049occurred in iteration=14, 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: 3.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 17563 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 9846 NumberOfCodeBlocks, 9846 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 9824 ConstructedInterpolants, 452 QuantifiedInterpolants, 32133013 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3145 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 15687/17374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown