java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:06:17,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:06:17,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:06:17,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:06:17,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:06:17,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:06:17,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:06:17,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:06:17,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:06:17,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:06:17,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:06:17,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:06:17,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:06:17,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:06:17,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:06:17,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:06:17,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:06:17,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:06:17,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:06:17,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:06:17,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:06:17,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:06:17,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:06:17,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:06:17,491 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:06:17,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:06:17,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:06:17,494 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:06:17,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:06:17,496 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:06:17,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:06:17,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:06:17,497 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:06:17,497 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:06:17,498 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:06:17,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:06:17,499 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 20:06:17,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:06:17,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:06:17,518 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:06:17,518 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:06:17,519 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:06:17,519 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:06:17,519 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:06:17,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:06:17,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:06:17,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:06:17,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:06:17,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:06:17,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:06:17,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:06:17,522 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:06:17,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:06:17,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:06:17,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:06:17,523 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:06:17,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:06:17,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:06:17,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:06:17,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:06:17,524 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:06:17,525 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:06:17,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:06:17,525 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:06:17,526 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:06:17,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:06:17,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:06:17,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:06:17,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:06:17,593 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:06:17,594 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label56_true-unreach-call.c [2018-10-26 20:06:17,667 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8ab6a6ed0/d1c4fac38f734271a1a840a94b0ebd2f/FLAGb8b194dba [2018-10-26 20:06:18,342 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:06:18,343 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label56_true-unreach-call.c [2018-10-26 20:06:18,365 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8ab6a6ed0/d1c4fac38f734271a1a840a94b0ebd2f/FLAGb8b194dba [2018-10-26 20:06:18,379 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8ab6a6ed0/d1c4fac38f734271a1a840a94b0ebd2f [2018-10-26 20:06:18,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:06:18,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:06:18,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:06:18,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:06:18,396 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:06:18,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:06:18" (1/1) ... [2018-10-26 20:06:18,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:18, skipping insertion in model container [2018-10-26 20:06:18,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:06:18" (1/1) ... [2018-10-26 20:06:18,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:06:18,501 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:06:19,264 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:06:19,269 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:06:19,544 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:06:19,568 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:06:19,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19 WrapperNode [2018-10-26 20:06:19,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:06:19,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:06:19,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:06:19,570 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:06:19,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:06:19,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:06:19,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:06:19,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:06:19,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... [2018-10-26 20:06:19,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:06:19,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:06:19,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:06:19,985 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:06:19,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:06:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:06:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:06:20,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:06:25,331 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:06:25,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:06:25 BoogieIcfgContainer [2018-10-26 20:06:25,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:06:25,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:06:25,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:06:25,337 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:06:25,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:06:18" (1/3) ... [2018-10-26 20:06:25,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b745764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:06:25, skipping insertion in model container [2018-10-26 20:06:25,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:19" (2/3) ... [2018-10-26 20:06:25,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b745764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:06:25, skipping insertion in model container [2018-10-26 20:06:25,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:06:25" (3/3) ... [2018-10-26 20:06:25,341 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label56_true-unreach-call.c [2018-10-26 20:06:25,351 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:06:25,361 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:06:25,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:06:25,420 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:06:25,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:06:25,421 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:06:25,421 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:06:25,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:06:25,422 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:06:25,422 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:06:25,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:06:25,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:06:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:06:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 20:06:25,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:25,469 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:25,472 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:25,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash 87318124, now seen corresponding path program 1 times [2018-10-26 20:06:25,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:25,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:25,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:26,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:26,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:26,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:26,508 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:06:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:29,766 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-10-26 20:06:29,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:29,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-10-26 20:06:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:29,798 INFO L225 Difference]: With dead ends: 1079 [2018-10-26 20:06:29,798 INFO L226 Difference]: Without dead ends: 769 [2018-10-26 20:06:29,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-26 20:06:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-10-26 20:06:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-26 20:06:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-10-26 20:06:29,914 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 174 [2018-10-26 20:06:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:29,915 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-10-26 20:06:29,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-10-26 20:06:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 20:06:29,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:29,920 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:29,921 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:29,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:29,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2060318933, now seen corresponding path program 1 times [2018-10-26 20:06:29,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:29,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:29,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:30,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:30,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:06:30,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:30,070 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-10-26 20:06:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:31,946 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-10-26 20:06:31,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:31,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-26 20:06:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:31,954 INFO L225 Difference]: With dead ends: 1449 [2018-10-26 20:06:31,954 INFO L226 Difference]: Without dead ends: 938 [2018-10-26 20:06:31,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-26 20:06:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-10-26 20:06:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-26 20:06:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-26 20:06:31,998 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 183 [2018-10-26 20:06:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:31,998 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-26 20:06:31,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-26 20:06:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:06:32,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:32,002 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:32,003 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:32,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:32,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2090442349, now seen corresponding path program 1 times [2018-10-26 20:06:32,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:32,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:32,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:32,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:32,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:32,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:32,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:32,123 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 4 states. [2018-10-26 20:06:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:35,770 INFO L93 Difference]: Finished difference Result 3530 states and 5871 transitions. [2018-10-26 20:06:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:35,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 20:06:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:35,785 INFO L225 Difference]: With dead ends: 3530 [2018-10-26 20:06:35,786 INFO L226 Difference]: Without dead ends: 2609 [2018-10-26 20:06:35,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2018-10-26 20:06:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1750. [2018-10-26 20:06:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-26 20:06:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2700 transitions. [2018-10-26 20:06:35,833 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2700 transitions. Word has length 184 [2018-10-26 20:06:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:35,833 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 2700 transitions. [2018-10-26 20:06:35,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2700 transitions. [2018-10-26 20:06:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 20:06:35,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:35,839 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:35,839 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:35,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash -805935034, now seen corresponding path program 1 times [2018-10-26 20:06:35,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:35,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:35,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:35,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:36,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:06:36,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:36,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:36,024 INFO L87 Difference]: Start difference. First operand 1750 states and 2700 transitions. Second operand 3 states. [2018-10-26 20:06:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:37,561 INFO L93 Difference]: Finished difference Result 4327 states and 6643 transitions. [2018-10-26 20:06:37,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:37,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2018-10-26 20:06:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:37,580 INFO L225 Difference]: With dead ends: 4327 [2018-10-26 20:06:37,581 INFO L226 Difference]: Without dead ends: 2579 [2018-10-26 20:06:37,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2018-10-26 20:06:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2578. [2018-10-26 20:06:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2018-10-26 20:06:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3889 transitions. [2018-10-26 20:06:37,648 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3889 transitions. Word has length 185 [2018-10-26 20:06:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:37,648 INFO L481 AbstractCegarLoop]: Abstraction has 2578 states and 3889 transitions. [2018-10-26 20:06:37,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3889 transitions. [2018-10-26 20:06:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-26 20:06:37,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:37,655 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:37,655 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:37,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:37,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1997399041, now seen corresponding path program 1 times [2018-10-26 20:06:37,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:37,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:37,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:06:37,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:37,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:37,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:37,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:37,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:37,922 INFO L87 Difference]: Start difference. First operand 2578 states and 3889 transitions. Second operand 3 states. [2018-10-26 20:06:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:39,935 INFO L93 Difference]: Finished difference Result 7609 states and 11523 transitions. [2018-10-26 20:06:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:39,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-10-26 20:06:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:39,959 INFO L225 Difference]: With dead ends: 7609 [2018-10-26 20:06:39,959 INFO L226 Difference]: Without dead ends: 5033 [2018-10-26 20:06:39,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2018-10-26 20:06:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 5032. [2018-10-26 20:06:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5032 states. [2018-10-26 20:06:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 7054 transitions. [2018-10-26 20:06:40,058 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 7054 transitions. Word has length 191 [2018-10-26 20:06:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:40,059 INFO L481 AbstractCegarLoop]: Abstraction has 5032 states and 7054 transitions. [2018-10-26 20:06:40,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 7054 transitions. [2018-10-26 20:06:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:06:40,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:40,070 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:40,070 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:40,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash -469460966, now seen corresponding path program 1 times [2018-10-26 20:06:40,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:40,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:40,510 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-26 20:06:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:40,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:40,639 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:06:40,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:40,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:06:40,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:06:40,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 20:06:40,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:40,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:40,991 INFO L87 Difference]: Start difference. First operand 5032 states and 7054 transitions. Second operand 7 states. [2018-10-26 20:06:41,167 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:06:42,685 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 20:06:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:47,804 INFO L93 Difference]: Finished difference Result 22542 states and 31619 transitions. [2018-10-26 20:06:47,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:47,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2018-10-26 20:06:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:47,871 INFO L225 Difference]: With dead ends: 22542 [2018-10-26 20:06:47,872 INFO L226 Difference]: Without dead ends: 17512 [2018-10-26 20:06:47,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:06:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17512 states. [2018-10-26 20:06:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17512 to 16278. [2018-10-26 20:06:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16278 states. [2018-10-26 20:06:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16278 states to 16278 states and 19571 transitions. [2018-10-26 20:06:48,231 INFO L78 Accepts]: Start accepts. Automaton has 16278 states and 19571 transitions. Word has length 193 [2018-10-26 20:06:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:48,231 INFO L481 AbstractCegarLoop]: Abstraction has 16278 states and 19571 transitions. [2018-10-26 20:06:48,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16278 states and 19571 transitions. [2018-10-26 20:06:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 20:06:48,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:48,258 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:48,258 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:48,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash -61273728, now seen corresponding path program 1 times [2018-10-26 20:06:48,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:48,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:48,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 20:06:48,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:48,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:48,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:48,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:48,532 INFO L87 Difference]: Start difference. First operand 16278 states and 19571 transitions. Second operand 4 states. [2018-10-26 20:06:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:50,124 INFO L93 Difference]: Finished difference Result 32349 states and 38826 transitions. [2018-10-26 20:06:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:50,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2018-10-26 20:06:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:50,156 INFO L225 Difference]: With dead ends: 32349 [2018-10-26 20:06:50,156 INFO L226 Difference]: Without dead ends: 16073 [2018-10-26 20:06:50,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16073 states. [2018-10-26 20:06:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16073 to 16072. [2018-10-26 20:06:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16072 states. [2018-10-26 20:06:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 18562 transitions. [2018-10-26 20:06:50,418 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 18562 transitions. Word has length 218 [2018-10-26 20:06:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:50,419 INFO L481 AbstractCegarLoop]: Abstraction has 16072 states and 18562 transitions. [2018-10-26 20:06:50,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 18562 transitions. [2018-10-26 20:06:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-26 20:06:50,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:50,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:50,447 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:50,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1151906626, now seen corresponding path program 1 times [2018-10-26 20:06:50,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:50,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:50,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:50,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:50,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:50,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:50,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:50,710 INFO L87 Difference]: Start difference. First operand 16072 states and 18562 transitions. Second operand 4 states. [2018-10-26 20:06:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:52,681 INFO L93 Difference]: Finished difference Result 39551 states and 45542 transitions. [2018-10-26 20:06:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:52,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-10-26 20:06:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:52,725 INFO L225 Difference]: With dead ends: 39551 [2018-10-26 20:06:52,725 INFO L226 Difference]: Without dead ends: 23481 [2018-10-26 20:06:52,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23481 states. [2018-10-26 20:06:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23481 to 18126. [2018-10-26 20:06:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18126 states. [2018-10-26 20:06:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18126 states to 18126 states and 20829 transitions. [2018-10-26 20:06:53,022 INFO L78 Accepts]: Start accepts. Automaton has 18126 states and 20829 transitions. Word has length 238 [2018-10-26 20:06:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:53,022 INFO L481 AbstractCegarLoop]: Abstraction has 18126 states and 20829 transitions. [2018-10-26 20:06:53,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 18126 states and 20829 transitions. [2018-10-26 20:06:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 20:06:53,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:53,054 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:53,054 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:53,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1089644182, now seen corresponding path program 1 times [2018-10-26 20:06:53,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:53,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:53,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:53,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:53,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:53,397 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:06:53,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:53,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:06:53,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:06:53,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 20:06:53,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:06:53,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:06:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:06:53,634 INFO L87 Difference]: Start difference. First operand 18126 states and 20829 transitions. Second operand 6 states. [2018-10-26 20:06:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:58,989 INFO L93 Difference]: Finished difference Result 58010 states and 67052 transitions. [2018-10-26 20:06:59,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:06:59,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2018-10-26 20:06:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:59,055 INFO L225 Difference]: With dead ends: 58010 [2018-10-26 20:06:59,056 INFO L226 Difference]: Without dead ends: 39886 [2018-10-26 20:06:59,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:06:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39886 states. [2018-10-26 20:06:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39886 to 33951. [2018-10-26 20:06:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33951 states. [2018-10-26 20:06:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33951 states to 33951 states and 38016 transitions. [2018-10-26 20:06:59,528 INFO L78 Accepts]: Start accepts. Automaton has 33951 states and 38016 transitions. Word has length 246 [2018-10-26 20:06:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:59,529 INFO L481 AbstractCegarLoop]: Abstraction has 33951 states and 38016 transitions. [2018-10-26 20:06:59,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:06:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 33951 states and 38016 transitions. [2018-10-26 20:06:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-26 20:06:59,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:59,573 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:59,574 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:59,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash -263270503, now seen corresponding path program 1 times [2018-10-26 20:06:59,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:59,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 20:06:59,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:59,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:06:59,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:59,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:59,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:59,759 INFO L87 Difference]: Start difference. First operand 33951 states and 38016 transitions. Second operand 3 states. [2018-10-26 20:07:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:00,744 INFO L93 Difference]: Finished difference Result 63552 states and 71066 transitions. [2018-10-26 20:07:00,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:00,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-10-26 20:07:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:00,785 INFO L225 Difference]: With dead ends: 63552 [2018-10-26 20:07:00,785 INFO L226 Difference]: Without dead ends: 29603 [2018-10-26 20:07:00,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29603 states. [2018-10-26 20:07:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29603 to 26332. [2018-10-26 20:07:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26332 states. [2018-10-26 20:07:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26332 states to 26332 states and 29322 transitions. [2018-10-26 20:07:01,163 INFO L78 Accepts]: Start accepts. Automaton has 26332 states and 29322 transitions. Word has length 248 [2018-10-26 20:07:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:01,163 INFO L481 AbstractCegarLoop]: Abstraction has 26332 states and 29322 transitions. [2018-10-26 20:07:01,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:07:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 26332 states and 29322 transitions. [2018-10-26 20:07:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-26 20:07:01,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:01,187 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:01,187 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:01,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:01,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1007711525, now seen corresponding path program 1 times [2018-10-26 20:07:01,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:01,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:01,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:01,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:01,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 20:07:01,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:01,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:01,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:07:01,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:07:01,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:01,482 INFO L87 Difference]: Start difference. First operand 26332 states and 29322 transitions. Second operand 4 states. [2018-10-26 20:07:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:03,476 INFO L93 Difference]: Finished difference Result 85396 states and 94836 transitions. [2018-10-26 20:07:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:03,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2018-10-26 20:07:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:03,532 INFO L225 Difference]: With dead ends: 85396 [2018-10-26 20:07:03,532 INFO L226 Difference]: Without dead ends: 59066 [2018-10-26 20:07:03,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59066 states. [2018-10-26 20:07:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59066 to 44078. [2018-10-26 20:07:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44078 states. [2018-10-26 20:07:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44078 states to 44078 states and 48660 transitions. [2018-10-26 20:07:04,136 INFO L78 Accepts]: Start accepts. Automaton has 44078 states and 48660 transitions. Word has length 263 [2018-10-26 20:07:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:04,136 INFO L481 AbstractCegarLoop]: Abstraction has 44078 states and 48660 transitions. [2018-10-26 20:07:04,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 44078 states and 48660 transitions. [2018-10-26 20:07:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 20:07:04,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:04,149 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:04,149 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:04,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:04,150 INFO L82 PathProgramCache]: Analyzing trace with hash 738292085, now seen corresponding path program 1 times [2018-10-26 20:07:04,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:04,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:04,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:04,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:04,645 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 20:07:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 20:07:04,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:04,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:07:04,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:07:04,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:07:04,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:07:04,716 INFO L87 Difference]: Start difference. First operand 44078 states and 48660 transitions. Second operand 5 states. [2018-10-26 20:07:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:07,221 INFO L93 Difference]: Finished difference Result 111945 states and 123537 transitions. [2018-10-26 20:07:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:07:07,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-10-26 20:07:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:07,288 INFO L225 Difference]: With dead ends: 111945 [2018-10-26 20:07:07,288 INFO L226 Difference]: Without dead ends: 67869 [2018-10-26 20:07:07,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:07:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67869 states. [2018-10-26 20:07:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67869 to 63549. [2018-10-26 20:07:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63549 states. [2018-10-26 20:07:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63549 states to 63549 states and 69942 transitions. [2018-10-26 20:07:08,422 INFO L78 Accepts]: Start accepts. Automaton has 63549 states and 69942 transitions. Word has length 269 [2018-10-26 20:07:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:08,422 INFO L481 AbstractCegarLoop]: Abstraction has 63549 states and 69942 transitions. [2018-10-26 20:07:08,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:07:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 63549 states and 69942 transitions. [2018-10-26 20:07:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-26 20:07:08,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:08,436 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:08,436 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:08,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1364505268, now seen corresponding path program 1 times [2018-10-26 20:07:08,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:08,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:08,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:08,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:08,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:08,847 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:07:09,089 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-26 20:07:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:07:09,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:09,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:07:09,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:07:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:07:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:07:09,157 INFO L87 Difference]: Start difference. First operand 63549 states and 69942 transitions. Second operand 5 states. [2018-10-26 20:07:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:13,116 INFO L93 Difference]: Finished difference Result 301104 states and 331112 transitions. [2018-10-26 20:07:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:07:13,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-10-26 20:07:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:13,444 INFO L225 Difference]: With dead ends: 301104 [2018-10-26 20:07:13,444 INFO L226 Difference]: Without dead ends: 237557 [2018-10-26 20:07:13,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:07:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237557 states. [2018-10-26 20:07:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237557 to 174215. [2018-10-26 20:07:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174215 states. [2018-10-26 20:07:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174215 states to 174215 states and 191324 transitions. [2018-10-26 20:07:16,371 INFO L78 Accepts]: Start accepts. Automaton has 174215 states and 191324 transitions. Word has length 284 [2018-10-26 20:07:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:16,372 INFO L481 AbstractCegarLoop]: Abstraction has 174215 states and 191324 transitions. [2018-10-26 20:07:16,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:07:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 174215 states and 191324 transitions. [2018-10-26 20:07:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-26 20:07:16,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:16,398 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:16,398 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:16,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash 382011990, now seen corresponding path program 1 times [2018-10-26 20:07:16,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:16,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:16,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:16,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:16,858 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 20:07:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 20:07:16,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:16,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:07:16,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:07:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:07:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:16,974 INFO L87 Difference]: Start difference. First operand 174215 states and 191324 transitions. Second operand 4 states. [2018-10-26 20:07:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:21,226 INFO L93 Difference]: Finished difference Result 355421 states and 389897 transitions. [2018-10-26 20:07:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:21,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2018-10-26 20:07:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:21,413 INFO L225 Difference]: With dead ends: 355421 [2018-10-26 20:07:21,413 INFO L226 Difference]: Without dead ends: 181208 [2018-10-26 20:07:21,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181208 states. [2018-10-26 20:07:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181208 to 173803. [2018-10-26 20:07:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173803 states. [2018-10-26 20:07:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173803 states to 173803 states and 189632 transitions. [2018-10-26 20:07:24,760 INFO L78 Accepts]: Start accepts. Automaton has 173803 states and 189632 transitions. Word has length 370 [2018-10-26 20:07:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:24,760 INFO L481 AbstractCegarLoop]: Abstraction has 173803 states and 189632 transitions. [2018-10-26 20:07:24,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 173803 states and 189632 transitions. [2018-10-26 20:07:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-26 20:07:24,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:24,788 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:07:24,788 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:24,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 327372158, now seen corresponding path program 1 times [2018-10-26 20:07:24,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:24,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:24,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:24,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-10-26 20:07:25,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:25,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:25,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:07:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:07:25,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:25,150 INFO L87 Difference]: Start difference. First operand 173803 states and 189632 transitions. Second operand 4 states. [2018-10-26 20:07:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:28,810 INFO L93 Difference]: Finished difference Result 503641 states and 547654 transitions. [2018-10-26 20:07:28,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:28,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2018-10-26 20:07:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:29,167 INFO L225 Difference]: With dead ends: 503641 [2018-10-26 20:07:29,168 INFO L226 Difference]: Without dead ends: 329840 [2018-10-26 20:07:29,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329840 states. [2018-10-26 20:07:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329840 to 324307. [2018-10-26 20:07:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324307 states. [2018-10-26 20:07:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324307 states to 324307 states and 351944 transitions. [2018-10-26 20:07:40,778 INFO L78 Accepts]: Start accepts. Automaton has 324307 states and 351944 transitions. Word has length 376 [2018-10-26 20:07:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:40,778 INFO L481 AbstractCegarLoop]: Abstraction has 324307 states and 351944 transitions. [2018-10-26 20:07:40,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 324307 states and 351944 transitions. [2018-10-26 20:07:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-26 20:07:40,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:40,808 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:07:40,808 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:40,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:40,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2139616138, now seen corresponding path program 1 times [2018-10-26 20:07:40,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:40,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:40,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:40,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:40,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 203 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 20:07:41,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:07:41,250 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:07:41,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:41,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-26 20:07:41,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:07:41,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-26 20:07:41,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:07:41,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:07:41,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:07:41,597 INFO L87 Difference]: Start difference. First operand 324307 states and 351944 transitions. Second operand 8 states. [2018-10-26 20:08:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:05,606 INFO L93 Difference]: Finished difference Result 3034105 states and 3282455 transitions. [2018-10-26 20:08:05,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 20:08:05,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 397 [2018-10-26 20:08:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:09,431 INFO L225 Difference]: With dead ends: 3034105 [2018-10-26 20:08:09,431 INFO L226 Difference]: Without dead ends: 2703240 [2018-10-26 20:08:12,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 396 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:08:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703240 states. [2018-10-26 20:08:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703240 to 1679271. [2018-10-26 20:08:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679271 states. [2018-10-26 20:09:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679271 states to 1679271 states and 1803974 transitions. [2018-10-26 20:09:24,305 INFO L78 Accepts]: Start accepts. Automaton has 1679271 states and 1803974 transitions. Word has length 397 [2018-10-26 20:09:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:24,306 INFO L481 AbstractCegarLoop]: Abstraction has 1679271 states and 1803974 transitions. [2018-10-26 20:09:24,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:09:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1679271 states and 1803974 transitions. [2018-10-26 20:09:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-26 20:09:24,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:24,371 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:09:24,371 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:24,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:24,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1787065866, now seen corresponding path program 1 times [2018-10-26 20:09:24,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:09:24,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:09:24,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:09:24,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:24,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:09:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 20:09:24,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:24,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:09:24,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:09:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:09:24,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:09:24,782 INFO L87 Difference]: Start difference. First operand 1679271 states and 1803974 transitions. Second operand 4 states. Received shutdown request... [2018-10-26 20:09:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:09:36,165 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:09:36,171 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:09:36,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:09:36 BoogieIcfgContainer [2018-10-26 20:09:36,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:09:36,172 INFO L168 Benchmark]: Toolchain (without parser) took 197782.21 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 4.3 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-10-26 20:09:36,173 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:09:36,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1177.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:09:36,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 296.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -887.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-26 20:09:36,175 INFO L168 Benchmark]: Boogie Preprocessor took 117.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-10-26 20:09:36,176 INFO L168 Benchmark]: RCFGBuilder took 5346.85 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: 252.7 MB). Peak memory consumption was 252.7 MB. Max. memory is 7.1 GB. [2018-10-26 20:09:36,177 INFO L168 Benchmark]: TraceAbstraction took 190838.46 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 2.0 GB in the beginning and 4.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-10-26 20:09:36,182 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.22 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 1177.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 296.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -887.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5346.85 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: 252.7 MB). Peak memory consumption was 252.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190838.46 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 2.0 GB in the beginning and 4.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1554]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1554). Cancelled while BasicCegarLoop was constructing difference of abstraction (1679271states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (573507 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 190.7s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 89.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4684 SDtfs, 18954 SDslu, 5402 SDs, 0 SdLazy, 21779 SolverSat, 5318 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 921 GetRequests, 857 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1679271occurred in iteration=16, 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: 93.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1136485 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 5292 NumberOfCodeBlocks, 5292 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5272 ConstructedInterpolants, 0 QuantifiedInterpolants, 3389546 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 2605/2623 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown