java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:59:32,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:59:32,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:59:32,338 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:59:32,339 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:59:32,340 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:59:32,341 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:59:32,343 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:59:32,344 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:59:32,345 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:59:32,346 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:59:32,346 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:59:32,347 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:59:32,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:59:32,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:59:32,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:59:32,360 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:59:32,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:59:32,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:59:32,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:59:32,370 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:59:32,371 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:59:32,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:59:32,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:59:32,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:59:32,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:59:32,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:59:32,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:59:32,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:59:32,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:59:32,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:59:32,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:59:32,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:59:32,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:59:32,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:59:32,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:59:32,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:59:32,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:59:32,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:59:32,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:59:32,413 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:59:32,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:59:32,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:59:32,414 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:59:32,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:59:32,415 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:59:32,415 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:59:32,415 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:59:32,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:59:32,415 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:59:32,416 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:59:32,416 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:59:32,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:59:32,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:59:32,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:59:32,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:59:32,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:59:32,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:59:32,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:59:32,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:59:32,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:59:32,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:59:32,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:59:32,418 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:59:32,418 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:59:32,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:59:32,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:59:32,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:59:32,486 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:59:32,488 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:59:32,489 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-11-06 19:59:32,555 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99e3926f/14c6c4acbebb485eb62db49f8d0e1279/FLAGf170c5427 [2018-11-06 19:59:33,221 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:59:33,222 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-11-06 19:59:33,244 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99e3926f/14c6c4acbebb485eb62db49f8d0e1279/FLAGf170c5427 [2018-11-06 19:59:33,263 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99e3926f/14c6c4acbebb485eb62db49f8d0e1279 [2018-11-06 19:59:33,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:59:33,277 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:59:33,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:59:33,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:59:33,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:59:33,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:33" (1/1) ... [2018-11-06 19:59:33,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d874f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:33, skipping insertion in model container [2018-11-06 19:59:33,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:33" (1/1) ... [2018-11-06 19:59:33,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:59:33,401 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:59:34,126 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:59:34,133 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:59:34,397 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:59:34,422 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:59:34,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34 WrapperNode [2018-11-06 19:59:34,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:59:34,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:59:34,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:59:34,425 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:59:34,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:59:34,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:59:34,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:59:34,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:59:34,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... [2018-11-06 19:59:34,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:59:34,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:59:34,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:59:34,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:59:34,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:59:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:59:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:59:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:59:40,325 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:59:40,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:40 BoogieIcfgContainer [2018-11-06 19:59:40,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:59:40,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:59:40,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:59:40,331 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:59:40,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:59:33" (1/3) ... [2018-11-06 19:59:40,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247c083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:40, skipping insertion in model container [2018-11-06 19:59:40,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:34" (2/3) ... [2018-11-06 19:59:40,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247c083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:40, skipping insertion in model container [2018-11-06 19:59:40,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:40" (3/3) ... [2018-11-06 19:59:40,335 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53_true-unreach-call.c [2018-11-06 19:59:40,346 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:59:40,355 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:59:40,373 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:59:40,409 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:59:40,410 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:59:40,410 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:59:40,410 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:59:40,410 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:59:40,411 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:59:40,411 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:59:40,411 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:59:40,411 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:59:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:59:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-06 19:59:40,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:40,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:40,465 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:40,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:40,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2009406410, now seen corresponding path program 1 times [2018-11-06 19:59:40,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:40,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:40,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:40,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:40,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:41,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:41,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:41,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:41,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:41,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:41,465 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:59:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:44,572 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-11-06 19:59:44,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:44,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-11-06 19:59:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:44,600 INFO L225 Difference]: With dead ends: 1089 [2018-11-06 19:59:44,600 INFO L226 Difference]: Without dead ends: 779 [2018-11-06 19:59:44,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-06 19:59:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-11-06 19:59:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-06 19:59:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-11-06 19:59:44,691 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 195 [2018-11-06 19:59:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:44,693 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-11-06 19:59:44,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-11-06 19:59:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-06 19:59:44,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:44,701 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:44,701 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:44,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash -907220423, now seen corresponding path program 1 times [2018-11-06 19:59:44,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:44,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:44,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:44,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:44,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:44,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:44,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:44,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:44,976 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-11-06 19:59:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:49,639 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-11-06 19:59:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:49,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-06 19:59:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:49,649 INFO L225 Difference]: With dead ends: 1904 [2018-11-06 19:59:49,649 INFO L226 Difference]: Without dead ends: 1391 [2018-11-06 19:59:49,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-11-06 19:59:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-11-06 19:59:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-11-06 19:59:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-11-06 19:59:49,694 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 201 [2018-11-06 19:59:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:49,694 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-11-06 19:59:49,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-11-06 19:59:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-06 19:59:49,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:49,700 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:49,701 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:49,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash 330620286, now seen corresponding path program 1 times [2018-11-06 19:59:49,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:49,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:49,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:49,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:49,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:49,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:49,817 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-11-06 19:59:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:51,667 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-11-06 19:59:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:51,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-11-06 19:59:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:51,687 INFO L225 Difference]: With dead ends: 2711 [2018-11-06 19:59:51,687 INFO L226 Difference]: Without dead ends: 1786 [2018-11-06 19:59:51,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-11-06 19:59:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-11-06 19:59:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-11-06 19:59:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-11-06 19:59:51,745 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 202 [2018-11-06 19:59:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:51,745 INFO L480 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-11-06 19:59:51,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-11-06 19:59:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-06 19:59:51,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:51,753 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:51,754 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:51,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:51,754 INFO L82 PathProgramCache]: Analyzing trace with hash -400117653, now seen corresponding path program 1 times [2018-11-06 19:59:51,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:51,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:51,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:51,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:51,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:51,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:51,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:51,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:51,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:51,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:51,881 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-11-06 19:59:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:53,311 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-11-06 19:59:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:53,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-11-06 19:59:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:53,329 INFO L225 Difference]: With dead ends: 5215 [2018-11-06 19:59:53,330 INFO L226 Difference]: Without dead ends: 3433 [2018-11-06 19:59:53,332 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-11-06 19:59:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-11-06 19:59:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-11-06 19:59:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-11-06 19:59:53,400 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 204 [2018-11-06 19:59:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:53,400 INFO L480 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-11-06 19:59:53,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-11-06 19:59:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-06 19:59:53,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:53,410 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:53,410 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:53,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1921534150, now seen corresponding path program 1 times [2018-11-06 19:59:53,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:53,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:59:53,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:53,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:53,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:53,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:53,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:53,591 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 3 states. [2018-11-06 19:59:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:54,293 INFO L93 Difference]: Finished difference Result 10229 states and 15374 transitions. [2018-11-06 19:59:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:54,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-11-06 19:59:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:54,324 INFO L225 Difference]: With dead ends: 10229 [2018-11-06 19:59:54,324 INFO L226 Difference]: Without dead ends: 6815 [2018-11-06 19:59:54,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6815 states. [2018-11-06 19:59:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6815 to 6811. [2018-11-06 19:59:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6811 states. [2018-11-06 19:59:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6811 states to 6811 states and 10227 transitions. [2018-11-06 19:59:54,479 INFO L78 Accepts]: Start accepts. Automaton has 6811 states and 10227 transitions. Word has length 218 [2018-11-06 19:59:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:54,479 INFO L480 AbstractCegarLoop]: Abstraction has 6811 states and 10227 transitions. [2018-11-06 19:59:54,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6811 states and 10227 transitions. [2018-11-06 19:59:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-06 19:59:54,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:54,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:54,495 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:54,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1444628378, now seen corresponding path program 1 times [2018-11-06 19:59:54,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:54,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:54,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:54,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:54,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:54,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:54,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:54,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:54,824 INFO L87 Difference]: Start difference. First operand 6811 states and 10227 transitions. Second operand 4 states. [2018-11-06 19:59:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:57,428 INFO L93 Difference]: Finished difference Result 26790 states and 40398 transitions. [2018-11-06 19:59:57,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:57,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-11-06 19:59:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:57,505 INFO L225 Difference]: With dead ends: 26790 [2018-11-06 19:59:57,505 INFO L226 Difference]: Without dead ends: 19981 [2018-11-06 19:59:57,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19981 states. [2018-11-06 19:59:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19981 to 13345. [2018-11-06 19:59:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13345 states. [2018-11-06 19:59:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13345 states to 13345 states and 19034 transitions. [2018-11-06 19:59:57,796 INFO L78 Accepts]: Start accepts. Automaton has 13345 states and 19034 transitions. Word has length 219 [2018-11-06 19:59:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:57,796 INFO L480 AbstractCegarLoop]: Abstraction has 13345 states and 19034 transitions. [2018-11-06 19:59:57,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 13345 states and 19034 transitions. [2018-11-06 19:59:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-06 19:59:57,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:57,824 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:57,824 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:57,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:57,825 INFO L82 PathProgramCache]: Analyzing trace with hash -626143831, now seen corresponding path program 1 times [2018-11-06 19:59:57,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:57,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:57,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:57,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:57,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:59:58,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:58,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:59:58,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:58,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:58,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:58,198 INFO L87 Difference]: Start difference. First operand 13345 states and 19034 transitions. Second operand 4 states. [2018-11-06 20:00:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:00,843 INFO L93 Difference]: Finished difference Result 50146 states and 71178 transitions. [2018-11-06 20:00:00,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:00,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-11-06 20:00:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:00,917 INFO L225 Difference]: With dead ends: 50146 [2018-11-06 20:00:00,917 INFO L226 Difference]: Without dead ends: 36803 [2018-11-06 20:00:00,938 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36803 states. [2018-11-06 20:00:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36803 to 36799. [2018-11-06 20:00:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36799 states. [2018-11-06 20:00:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36799 states to 36799 states and 46035 transitions. [2018-11-06 20:00:01,469 INFO L78 Accepts]: Start accepts. Automaton has 36799 states and 46035 transitions. Word has length 232 [2018-11-06 20:00:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:01,469 INFO L480 AbstractCegarLoop]: Abstraction has 36799 states and 46035 transitions. [2018-11-06 20:00:01,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36799 states and 46035 transitions. [2018-11-06 20:00:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-06 20:00:01,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:01,526 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:01,526 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:01,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash 405445227, now seen corresponding path program 1 times [2018-11-06 20:00:01,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:01,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:01,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:01,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:01,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-06 20:00:01,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:01,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 20:00:01,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:01,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:01,709 INFO L87 Difference]: Start difference. First operand 36799 states and 46035 transitions. Second operand 3 states. [2018-11-06 20:00:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:02,725 INFO L93 Difference]: Finished difference Result 71506 states and 89059 transitions. [2018-11-06 20:00:02,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:02,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-11-06 20:00:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:02,798 INFO L225 Difference]: With dead ends: 71506 [2018-11-06 20:00:02,798 INFO L226 Difference]: Without dead ends: 34709 [2018-11-06 20:00:02,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34709 states. [2018-11-06 20:00:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34709 to 34709. [2018-11-06 20:00:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34709 states. [2018-11-06 20:00:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34709 states to 34709 states and 42256 transitions. [2018-11-06 20:00:03,603 INFO L78 Accepts]: Start accepts. Automaton has 34709 states and 42256 transitions. Word has length 253 [2018-11-06 20:00:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:03,604 INFO L480 AbstractCegarLoop]: Abstraction has 34709 states and 42256 transitions. [2018-11-06 20:00:03,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 34709 states and 42256 transitions. [2018-11-06 20:00:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-06 20:00:03,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:03,637 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, 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] [2018-11-06 20:00:03,637 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:03,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:03,638 INFO L82 PathProgramCache]: Analyzing trace with hash -48503042, now seen corresponding path program 1 times [2018-11-06 20:00:03,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:03,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:03,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:04,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:04,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:04,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:04,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:04,285 INFO L87 Difference]: Start difference. First operand 34709 states and 42256 transitions. Second operand 4 states. [2018-11-06 20:00:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:06,025 INFO L93 Difference]: Finished difference Result 71880 states and 87371 transitions. [2018-11-06 20:00:06,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:06,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-11-06 20:00:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:06,079 INFO L225 Difference]: With dead ends: 71880 [2018-11-06 20:00:06,080 INFO L226 Difference]: Without dead ends: 37173 [2018-11-06 20:00:06,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37173 states. [2018-11-06 20:00:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37173 to 37169. [2018-11-06 20:00:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37169 states. [2018-11-06 20:00:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37169 states to 37169 states and 44967 transitions. [2018-11-06 20:00:06,593 INFO L78 Accepts]: Start accepts. Automaton has 37169 states and 44967 transitions. Word has length 270 [2018-11-06 20:00:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:06,594 INFO L480 AbstractCegarLoop]: Abstraction has 37169 states and 44967 transitions. [2018-11-06 20:00:06,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 37169 states and 44967 transitions. [2018-11-06 20:00:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-06 20:00:06,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:06,616 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:06,617 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:06,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:06,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785836, now seen corresponding path program 1 times [2018-11-06 20:00:06,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:06,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:06,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:06,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:06,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-06 20:00:06,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:06,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:06,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:06,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:06,856 INFO L87 Difference]: Start difference. First operand 37169 states and 44967 transitions. Second operand 3 states. [2018-11-06 20:00:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:09,436 INFO L93 Difference]: Finished difference Result 74338 states and 89936 transitions. [2018-11-06 20:00:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:09,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2018-11-06 20:00:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:09,482 INFO L225 Difference]: With dead ends: 74338 [2018-11-06 20:00:09,482 INFO L226 Difference]: Without dead ends: 37171 [2018-11-06 20:00:09,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37171 states. [2018-11-06 20:00:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37171 to 37169. [2018-11-06 20:00:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37169 states. [2018-11-06 20:00:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37169 states to 37169 states and 43322 transitions. [2018-11-06 20:00:09,920 INFO L78 Accepts]: Start accepts. Automaton has 37169 states and 43322 transitions. Word has length 306 [2018-11-06 20:00:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:09,921 INFO L480 AbstractCegarLoop]: Abstraction has 37169 states and 43322 transitions. [2018-11-06 20:00:09,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 37169 states and 43322 transitions. [2018-11-06 20:00:09,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-06 20:00:09,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:09,939 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:09,940 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:09,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:09,940 INFO L82 PathProgramCache]: Analyzing trace with hash 370758085, now seen corresponding path program 1 times [2018-11-06 20:00:09,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:09,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:09,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:09,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:09,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-06 20:00:10,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:10,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:10,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:10,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:10,169 INFO L87 Difference]: Start difference. First operand 37169 states and 43322 transitions. Second operand 3 states. [2018-11-06 20:00:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:11,762 INFO L93 Difference]: Finished difference Result 72636 states and 84664 transitions. [2018-11-06 20:00:11,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:11,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2018-11-06 20:00:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:11,804 INFO L225 Difference]: With dead ends: 72636 [2018-11-06 20:00:11,804 INFO L226 Difference]: Without dead ends: 35469 [2018-11-06 20:00:11,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35469 states. [2018-11-06 20:00:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35469 to 35465. [2018-11-06 20:00:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-11-06 20:00:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40049 transitions. [2018-11-06 20:00:12,263 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40049 transitions. Word has length 319 [2018-11-06 20:00:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:12,263 INFO L480 AbstractCegarLoop]: Abstraction has 35465 states and 40049 transitions. [2018-11-06 20:00:12,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40049 transitions. [2018-11-06 20:00:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-06 20:00:12,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:12,283 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:12,284 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:12,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash -539370600, now seen corresponding path program 1 times [2018-11-06 20:00:12,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:12,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:12,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:12,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-06 20:00:13,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:13,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 20:00:13,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:13,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:13,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:13,037 INFO L87 Difference]: Start difference. First operand 35465 states and 40049 transitions. Second operand 3 states. [2018-11-06 20:00:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:13,967 INFO L93 Difference]: Finished difference Result 69289 states and 78346 transitions. [2018-11-06 20:00:13,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:13,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2018-11-06 20:00:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:14,006 INFO L225 Difference]: With dead ends: 69289 [2018-11-06 20:00:14,006 INFO L226 Difference]: Without dead ends: 35463 [2018-11-06 20:00:14,031 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35463 states. [2018-11-06 20:00:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35463 to 35463. [2018-11-06 20:00:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35463 states. [2018-11-06 20:00:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35463 states to 35463 states and 40045 transitions. [2018-11-06 20:00:14,399 INFO L78 Accepts]: Start accepts. Automaton has 35463 states and 40045 transitions. Word has length 326 [2018-11-06 20:00:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:14,399 INFO L480 AbstractCegarLoop]: Abstraction has 35463 states and 40045 transitions. [2018-11-06 20:00:14,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 35463 states and 40045 transitions. [2018-11-06 20:00:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-06 20:00:14,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:14,421 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:14,421 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:14,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:14,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1874209680, now seen corresponding path program 1 times [2018-11-06 20:00:14,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:14,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:14,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-06 20:00:14,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:14,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:14,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:14,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:14,788 INFO L87 Difference]: Start difference. First operand 35463 states and 40045 transitions. Second operand 4 states. [2018-11-06 20:00:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:17,382 INFO L93 Difference]: Finished difference Result 70515 states and 79664 transitions. [2018-11-06 20:00:17,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:17,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-11-06 20:00:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:17,421 INFO L225 Difference]: With dead ends: 70515 [2018-11-06 20:00:17,421 INFO L226 Difference]: Without dead ends: 35054 [2018-11-06 20:00:17,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35054 states. [2018-11-06 20:00:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35054 to 35053. [2018-11-06 20:00:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35053 states. [2018-11-06 20:00:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35053 states to 35053 states and 38475 transitions. [2018-11-06 20:00:17,804 INFO L78 Accepts]: Start accepts. Automaton has 35053 states and 38475 transitions. Word has length 342 [2018-11-06 20:00:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:17,805 INFO L480 AbstractCegarLoop]: Abstraction has 35053 states and 38475 transitions. [2018-11-06 20:00:17,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 35053 states and 38475 transitions. [2018-11-06 20:00:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-06 20:00:17,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:17,821 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:17,821 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:17,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash -71967826, now seen corresponding path program 1 times [2018-11-06 20:00:17,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:17,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:17,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:17,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:17,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-06 20:00:18,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:18,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:18,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:18,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:18,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:18,269 INFO L87 Difference]: Start difference. First operand 35053 states and 38475 transitions. Second operand 4 states. [2018-11-06 20:00:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:21,149 INFO L93 Difference]: Finished difference Result 71140 states and 78180 transitions. [2018-11-06 20:00:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:21,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-11-06 20:00:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:21,201 INFO L225 Difference]: With dead ends: 71140 [2018-11-06 20:00:21,201 INFO L226 Difference]: Without dead ends: 37316 [2018-11-06 20:00:21,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37316 states. [2018-11-06 20:00:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37316 to 37303. [2018-11-06 20:00:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37303 states. [2018-11-06 20:00:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37303 states to 37303 states and 40895 transitions. [2018-11-06 20:00:21,559 INFO L78 Accepts]: Start accepts. Automaton has 37303 states and 40895 transitions. Word has length 342 [2018-11-06 20:00:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:21,560 INFO L480 AbstractCegarLoop]: Abstraction has 37303 states and 40895 transitions. [2018-11-06 20:00:21,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 37303 states and 40895 transitions. [2018-11-06 20:00:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-06 20:00:21,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:21,577 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:21,577 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:21,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:21,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1553900648, now seen corresponding path program 1 times [2018-11-06 20:00:21,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:21,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:21,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:21,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:21,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-11-06 20:00:21,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:21,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 20:00:21,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:21,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:21,804 INFO L87 Difference]: Start difference. First operand 37303 states and 40895 transitions. Second operand 3 states. [2018-11-06 20:00:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:23,264 INFO L93 Difference]: Finished difference Result 91825 states and 100517 transitions. [2018-11-06 20:00:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:23,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-11-06 20:00:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:23,319 INFO L225 Difference]: With dead ends: 91825 [2018-11-06 20:00:23,320 INFO L226 Difference]: Without dead ends: 55751 [2018-11-06 20:00:23,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55751 states. [2018-11-06 20:00:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55751 to 55748. [2018-11-06 20:00:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55748 states. [2018-11-06 20:00:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55748 states to 55748 states and 60878 transitions. [2018-11-06 20:00:23,910 INFO L78 Accepts]: Start accepts. Automaton has 55748 states and 60878 transitions. Word has length 348 [2018-11-06 20:00:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:23,911 INFO L480 AbstractCegarLoop]: Abstraction has 55748 states and 60878 transitions. [2018-11-06 20:00:23,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 55748 states and 60878 transitions. [2018-11-06 20:00:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-06 20:00:23,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:23,931 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:23,931 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:23,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2132933612, now seen corresponding path program 1 times [2018-11-06 20:00:23,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:23,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:23,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:23,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:23,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-11-06 20:00:24,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:24,195 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:00:24,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:24,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-06 20:00:24,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:24,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 20:00:24,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 20:00:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 20:00:24,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 20:00:24,920 INFO L87 Difference]: Start difference. First operand 55748 states and 60878 transitions. Second operand 6 states. [2018-11-06 20:00:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:31,861 INFO L93 Difference]: Finished difference Result 159029 states and 174177 transitions. [2018-11-06 20:00:31,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 20:00:31,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 356 [2018-11-06 20:00:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:32,155 INFO L225 Difference]: With dead ends: 159029 [2018-11-06 20:00:32,155 INFO L226 Difference]: Without dead ends: 104714 [2018-11-06 20:00:32,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 20:00:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104714 states. [2018-11-06 20:00:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104714 to 92259. [2018-11-06 20:00:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92259 states. [2018-11-06 20:00:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92259 states to 92259 states and 99762 transitions. [2018-11-06 20:00:34,268 INFO L78 Accepts]: Start accepts. Automaton has 92259 states and 99762 transitions. Word has length 356 [2018-11-06 20:00:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:34,269 INFO L480 AbstractCegarLoop]: Abstraction has 92259 states and 99762 transitions. [2018-11-06 20:00:34,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 20:00:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 92259 states and 99762 transitions. [2018-11-06 20:00:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-11-06 20:00:34,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:34,376 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:34,376 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:34,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash -232365187, now seen corresponding path program 1 times [2018-11-06 20:00:34,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:34,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:34,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:34,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-11-06 20:00:35,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:35,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:35,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:35,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:35,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:35,082 INFO L87 Difference]: Start difference. First operand 92259 states and 99762 transitions. Second operand 4 states. [2018-11-06 20:00:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:37,090 INFO L93 Difference]: Finished difference Result 342810 states and 371050 transitions. [2018-11-06 20:00:37,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:37,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 457 [2018-11-06 20:00:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:37,397 INFO L225 Difference]: With dead ends: 342810 [2018-11-06 20:00:37,398 INFO L226 Difference]: Without dead ends: 251984 [2018-11-06 20:00:37,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251984 states. [2018-11-06 20:00:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251984 to 162590. [2018-11-06 20:00:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162590 states. [2018-11-06 20:00:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162590 states to 162590 states and 176047 transitions. [2018-11-06 20:00:39,788 INFO L78 Accepts]: Start accepts. Automaton has 162590 states and 176047 transitions. Word has length 457 [2018-11-06 20:00:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:39,788 INFO L480 AbstractCegarLoop]: Abstraction has 162590 states and 176047 transitions. [2018-11-06 20:00:39,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 162590 states and 176047 transitions. [2018-11-06 20:00:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-11-06 20:00:39,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:39,848 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:39,848 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:39,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1170531438, now seen corresponding path program 1 times [2018-11-06 20:00:39,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:39,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:39,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:39,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:39,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-06 20:00:40,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:40,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:40,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:40,931 INFO L87 Difference]: Start difference. First operand 162590 states and 176047 transitions. Second operand 3 states. [2018-11-06 20:00:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:44,150 INFO L93 Difference]: Finished difference Result 433844 states and 468648 transitions. [2018-11-06 20:00:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:44,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2018-11-06 20:00:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:44,480 INFO L225 Difference]: With dead ends: 433844 [2018-11-06 20:00:44,481 INFO L226 Difference]: Without dead ends: 272687 [2018-11-06 20:00:44,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272687 states. [2018-11-06 20:00:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272687 to 272685. [2018-11-06 20:00:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272685 states. [2018-11-06 20:00:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272685 states to 272685 states and 292971 transitions. [2018-11-06 20:00:48,304 INFO L78 Accepts]: Start accepts. Automaton has 272685 states and 292971 transitions. Word has length 479 [2018-11-06 20:00:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:48,305 INFO L480 AbstractCegarLoop]: Abstraction has 272685 states and 292971 transitions. [2018-11-06 20:00:48,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 272685 states and 292971 transitions. [2018-11-06 20:00:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-11-06 20:00:48,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:48,368 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:48,368 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:48,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash 208632150, now seen corresponding path program 1 times [2018-11-06 20:00:48,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:48,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:48,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:48,837 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 20:00:49,046 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 20:00:49,258 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 20:00:49,464 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 20:00:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 396 proven. 29 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-06 20:00:50,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:50,155 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:00:50,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:50,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 350 proven. 52 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-06 20:00:51,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 20:00:51,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-11-06 20:00:51,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 20:00:51,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 20:00:51,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-06 20:00:51,405 INFO L87 Difference]: Start difference. First operand 272685 states and 292971 transitions. Second operand 12 states. [2018-11-06 20:00:51,793 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 20:01:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:01:29,493 INFO L93 Difference]: Finished difference Result 2094409 states and 2248871 transitions. [2018-11-06 20:01:29,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-06 20:01:29,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 481 [2018-11-06 20:01:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:01:32,175 INFO L225 Difference]: With dead ends: 2094409 [2018-11-06 20:01:32,176 INFO L226 Difference]: Without dead ends: 1821715 [2018-11-06 20:01:32,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2018-11-06 20:01:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821715 states. [2018-11-06 20:02:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821715 to 1819564. [2018-11-06 20:02:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819564 states. [2018-11-06 20:02:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819564 states to 1819564 states and 1941351 transitions. [2018-11-06 20:02:22,976 INFO L78 Accepts]: Start accepts. Automaton has 1819564 states and 1941351 transitions. Word has length 481 [2018-11-06 20:02:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:02:22,976 INFO L480 AbstractCegarLoop]: Abstraction has 1819564 states and 1941351 transitions. [2018-11-06 20:02:22,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 20:02:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1819564 states and 1941351 transitions. [2018-11-06 20:02:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-11-06 20:02:23,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:02:23,390 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 20:02:23,390 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:02:23,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:02:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1947764577, now seen corresponding path program 1 times [2018-11-06 20:02:23,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:02:23,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:02:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:02:23,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:02:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:02:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:02:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-06 20:02:25,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:02:25,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:02:25,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:02:25,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:02:25,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:02:25,110 INFO L87 Difference]: Start difference. First operand 1819564 states and 1941351 transitions. Second operand 3 states. Received shutdown request... [2018-11-06 20:02:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:02:46,680 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 20:02:46,687 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 20:02:46,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:02:46 BoogieIcfgContainer [2018-11-06 20:02:46,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 20:02:46,690 INFO L168 Benchmark]: Toolchain (without parser) took 193412.15 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.5 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. [2018-11-06 20:02:46,692 INFO L168 Benchmark]: CDTParser took 0.24 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-11-06 20:02:46,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1146.24 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:46,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 327.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -889.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:46,695 INFO L168 Benchmark]: Boogie Preprocessor took 106.13 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.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:46,696 INFO L168 Benchmark]: RCFGBuilder took 5467.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 274.0 MB). Peak memory consumption was 274.0 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:46,696 INFO L168 Benchmark]: TraceAbstraction took 186360.17 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 3.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. [2018-11-06 20:02:46,704 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.24 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 1146.24 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 327.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -889.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.13 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.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5467.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 274.0 MB). Peak memory consumption was 274.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186360.17 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 3.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1617]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1617). Cancelled while BasicCegarLoop was constructing difference of abstraction (1819564states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1595549 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 186.2s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 108.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5320 SDtfs, 20058 SDslu, 3917 SDs, 0 SdLazy, 23517 SolverSat, 5349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 937 GetRequests, 861 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1819564occurred in iteration=19, 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: 63.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 111420 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 7162 NumberOfCodeBlocks, 7162 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7140 ConstructedInterpolants, 0 QuantifiedInterpolants, 6321400 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 5089/5174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown