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_label12_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:52:45,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:52:45,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:52:45,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:52:45,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:52:45,606 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:52:45,607 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:52:45,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:52:45,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:52:45,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:52:45,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:52:45,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:52:45,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:52:45,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:52:45,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:52:45,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:52:45,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:52:45,631 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:52:45,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:52:45,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:52:45,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:52:45,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:52:45,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:52:45,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:52:45,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:52:45,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:52:45,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:52:45,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:52:45,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:52:45,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:52:45,660 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:52:45,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:52:45,661 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:52:45,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:52:45,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:52:45,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:52:45,665 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:52:45,691 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:52:45,691 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:52:45,694 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:52:45,694 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:52:45,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:52:45,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:52:45,695 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:52:45,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:52:45,696 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:52:45,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:52:45,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:52:45,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:52:45,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:52:45,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:52:45,698 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:52:45,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:52:45,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:52:45,699 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:52:45,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:52:45,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:45,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:52:45,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:52:45,701 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:52:45,701 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:52:45,701 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:52:45,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:52:45,702 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:52:45,702 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:52:45,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:52:45,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:52:45,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:52:45,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:52:45,789 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:52:45,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label12_true-unreach-call.c [2018-11-06 19:52:45,849 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68104f03f/f692062e00334c54a757cd599f2f162d/FLAGc05602750 [2018-11-06 19:52:46,452 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:52:46,453 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label12_true-unreach-call.c [2018-11-06 19:52:46,482 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68104f03f/f692062e00334c54a757cd599f2f162d/FLAGc05602750 [2018-11-06 19:52:46,504 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68104f03f/f692062e00334c54a757cd599f2f162d [2018-11-06 19:52:46,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:52:46,520 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:52:46,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:46,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:52:46,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:52:46,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:46" (1/1) ... [2018-11-06 19:52:46,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46117c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:46, skipping insertion in model container [2018-11-06 19:52:46,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:46" (1/1) ... [2018-11-06 19:52:46,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:52:46,629 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:52:47,408 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:47,414 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:52:47,765 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:47,790 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:52:47,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47 WrapperNode [2018-11-06 19:52:47,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:47,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:47,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:52:47,792 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:52:47,805 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:52:47" (1/1) ... [2018-11-06 19:52:48,010 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:52:47" (1/1) ... [2018-11-06 19:52:48,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:48,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:52:48,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:52:48,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:52:48,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (1/1) ... [2018-11-06 19:52:48,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (1/1) ... [2018-11-06 19:52:48,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (1/1) ... [2018-11-06 19:52:48,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (1/1) ... [2018-11-06 19:52:48,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (1/1) ... [2018-11-06 19:52:48,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (1/1) ... [2018-11-06 19:52:48,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (1/1) ... [2018-11-06 19:52:48,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:52:48,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:52:48,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:52:48,265 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:52:48,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (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:52:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:52:48,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:52:48,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:52:53,943 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:52:53,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:53 BoogieIcfgContainer [2018-11-06 19:52:53,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:52:53,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:52:53,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:52:53,950 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:52:53,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:52:46" (1/3) ... [2018-11-06 19:52:53,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5d76c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:53, skipping insertion in model container [2018-11-06 19:52:53,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:47" (2/3) ... [2018-11-06 19:52:53,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5d76c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:53, skipping insertion in model container [2018-11-06 19:52:53,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:53" (3/3) ... [2018-11-06 19:52:53,955 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label12_true-unreach-call.c [2018-11-06 19:52:53,966 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:52:53,976 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:52:53,993 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:52:54,027 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:52:54,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:52:54,028 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:52:54,028 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:52:54,028 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:52:54,028 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:52:54,028 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:52:54,028 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:52:54,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:52:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:52:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-06 19:52:54,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:54,074 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] [2018-11-06 19:52:54,077 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:54,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2121673340, now seen corresponding path program 1 times [2018-11-06 19:52:54,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:54,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:54,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:54,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:54,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:54,951 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:52:55,040 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:52:55,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:55,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:55,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:55,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:55,073 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:52:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:58,511 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-11-06 19:52:58,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:58,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-11-06 19:52:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:58,537 INFO L225 Difference]: With dead ends: 1072 [2018-11-06 19:52:58,537 INFO L226 Difference]: Without dead ends: 762 [2018-11-06 19:52:58,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-06 19:52:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-11-06 19:52:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-06 19:52:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-11-06 19:52:58,636 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 164 [2018-11-06 19:52:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:58,637 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-11-06 19:52:58,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-11-06 19:52:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-06 19:52:58,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:58,647 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] [2018-11-06 19:52:58,647 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:58,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:58,648 INFO L82 PathProgramCache]: Analyzing trace with hash -252847883, now seen corresponding path program 1 times [2018-11-06 19:52:58,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:58,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:58,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:58,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:58,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:58,950 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:52:58,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:58,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:58,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:58,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:58,954 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-11-06 19:53:02,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:02,372 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-11-06 19:53:02,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:02,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-11-06 19:53:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:02,381 INFO L225 Difference]: With dead ends: 1918 [2018-11-06 19:53:02,381 INFO L226 Difference]: Without dead ends: 1402 [2018-11-06 19:53:02,384 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:53:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-11-06 19:53:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-11-06 19:53:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-11-06 19:53:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-11-06 19:53:02,420 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 170 [2018-11-06 19:53:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:02,421 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-11-06 19:53:02,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-11-06 19:53:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-06 19:53:02,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:02,427 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] [2018-11-06 19:53:02,428 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:02,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1895862531, now seen corresponding path program 1 times [2018-11-06 19:53:02,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:02,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:02,531 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:53:02,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:02,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:02,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:02,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:02,532 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-11-06 19:53:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:04,963 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-11-06 19:53:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:04,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-11-06 19:53:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:04,974 INFO L225 Difference]: With dead ends: 2699 [2018-11-06 19:53:04,974 INFO L226 Difference]: Without dead ends: 1768 [2018-11-06 19:53:04,977 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:53:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-11-06 19:53:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-11-06 19:53:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-11-06 19:53:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-11-06 19:53:05,016 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 173 [2018-11-06 19:53:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:05,017 INFO L480 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-11-06 19:53:05,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-11-06 19:53:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 19:53:05,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:05,022 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:05,022 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:05,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash 407532060, now seen corresponding path program 1 times [2018-11-06 19:53:05,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:05,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:05,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:05,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:05,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:05,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:05,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:05,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:05,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:05,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:05,266 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 4 states. [2018-11-06 19:53:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:07,768 INFO L93 Difference]: Finished difference Result 6814 states and 10581 transitions. [2018-11-06 19:53:07,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:07,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-06 19:53:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:07,794 INFO L225 Difference]: With dead ends: 6814 [2018-11-06 19:53:07,794 INFO L226 Difference]: Without dead ends: 5065 [2018-11-06 19:53:07,798 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:53:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2018-11-06 19:53:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 3388. [2018-11-06 19:53:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-11-06 19:53:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4947 transitions. [2018-11-06 19:53:07,886 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4947 transitions. Word has length 180 [2018-11-06 19:53:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:07,887 INFO L480 AbstractCegarLoop]: Abstraction has 3388 states and 4947 transitions. [2018-11-06 19:53:07,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4947 transitions. [2018-11-06 19:53:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-06 19:53:07,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:07,894 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:07,894 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:07,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1147609385, now seen corresponding path program 1 times [2018-11-06 19:53:07,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:07,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:07,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:08,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:08,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:08,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:08,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:08,179 INFO L87 Difference]: Start difference. First operand 3388 states and 4947 transitions. Second operand 3 states. [2018-11-06 19:53:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:09,549 INFO L93 Difference]: Finished difference Result 6782 states and 9907 transitions. [2018-11-06 19:53:09,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:09,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-11-06 19:53:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:09,566 INFO L225 Difference]: With dead ends: 6782 [2018-11-06 19:53:09,566 INFO L226 Difference]: Without dead ends: 3396 [2018-11-06 19:53:09,571 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 19:53:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2018-11-06 19:53:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3388. [2018-11-06 19:53:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-11-06 19:53:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4647 transitions. [2018-11-06 19:53:09,628 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4647 transitions. Word has length 181 [2018-11-06 19:53:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:09,629 INFO L480 AbstractCegarLoop]: Abstraction has 3388 states and 4647 transitions. [2018-11-06 19:53:09,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4647 transitions. [2018-11-06 19:53:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-06 19:53:09,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:09,635 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:09,636 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:09,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:09,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1815897247, now seen corresponding path program 1 times [2018-11-06 19:53:09,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:09,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:09,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:09,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:09,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:09,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:09,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:09,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:09,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:09,783 INFO L87 Difference]: Start difference. First operand 3388 states and 4647 transitions. Second operand 3 states. [2018-11-06 19:53:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:11,396 INFO L93 Difference]: Finished difference Result 10041 states and 13801 transitions. [2018-11-06 19:53:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:11,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-11-06 19:53:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:11,419 INFO L225 Difference]: With dead ends: 10041 [2018-11-06 19:53:11,419 INFO L226 Difference]: Without dead ends: 6655 [2018-11-06 19:53:11,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6655 states. [2018-11-06 19:53:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6655 to 6652. [2018-11-06 19:53:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-11-06 19:53:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 8357 transitions. [2018-11-06 19:53:11,548 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 8357 transitions. Word has length 188 [2018-11-06 19:53:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:11,549 INFO L480 AbstractCegarLoop]: Abstraction has 6652 states and 8357 transitions. [2018-11-06 19:53:11,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 8357 transitions. [2018-11-06 19:53:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-06 19:53:11,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:11,561 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:11,561 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:11,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1150111061, now seen corresponding path program 1 times [2018-11-06 19:53:11,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:11,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:11,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:11,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:53:11,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:11,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:11,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:11,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:11,721 INFO L87 Difference]: Start difference. First operand 6652 states and 8357 transitions. Second operand 3 states. [2018-11-06 19:53:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:12,761 INFO L93 Difference]: Finished difference Result 13270 states and 16669 transitions. [2018-11-06 19:53:12,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:12,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-11-06 19:53:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:12,784 INFO L225 Difference]: With dead ends: 13270 [2018-11-06 19:53:12,785 INFO L226 Difference]: Without dead ends: 6620 [2018-11-06 19:53:12,793 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:53:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-11-06 19:53:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-11-06 19:53:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-11-06 19:53:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 8174 transitions. [2018-11-06 19:53:12,916 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 8174 transitions. Word has length 202 [2018-11-06 19:53:12,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:12,917 INFO L480 AbstractCegarLoop]: Abstraction has 6620 states and 8174 transitions. [2018-11-06 19:53:12,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 8174 transitions. [2018-11-06 19:53:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-06 19:53:12,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:12,931 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:12,931 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:12,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash 328527330, now seen corresponding path program 1 times [2018-11-06 19:53:12,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:12,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:12,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:13,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:13,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:13,194 INFO L87 Difference]: Start difference. First operand 6620 states and 8174 transitions. Second operand 3 states. [2018-11-06 19:53:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:14,561 INFO L93 Difference]: Finished difference Result 16094 states and 20196 transitions. [2018-11-06 19:53:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:14,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-11-06 19:53:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:14,587 INFO L225 Difference]: With dead ends: 16094 [2018-11-06 19:53:14,588 INFO L226 Difference]: Without dead ends: 9476 [2018-11-06 19:53:14,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2018-11-06 19:53:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 9476. [2018-11-06 19:53:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9476 states. [2018-11-06 19:53:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9476 states to 9476 states and 11228 transitions. [2018-11-06 19:53:14,735 INFO L78 Accepts]: Start accepts. Automaton has 9476 states and 11228 transitions. Word has length 213 [2018-11-06 19:53:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:14,735 INFO L480 AbstractCegarLoop]: Abstraction has 9476 states and 11228 transitions. [2018-11-06 19:53:14,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9476 states and 11228 transitions. [2018-11-06 19:53:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-06 19:53:14,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:14,750 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:14,751 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:14,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1054277103, now seen corresponding path program 1 times [2018-11-06 19:53:14,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:14,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:14,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:14,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:15,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:15,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:15,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:53:15,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:53:15,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:15,065 INFO L87 Difference]: Start difference. First operand 9476 states and 11228 transitions. Second operand 5 states. [2018-11-06 19:53:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:17,582 INFO L93 Difference]: Finished difference Result 30652 states and 36094 transitions. [2018-11-06 19:53:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:53:17,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2018-11-06 19:53:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:17,621 INFO L225 Difference]: With dead ends: 30652 [2018-11-06 19:53:17,621 INFO L226 Difference]: Without dead ends: 21178 [2018-11-06 19:53:17,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21178 states. [2018-11-06 19:53:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21178 to 21173. [2018-11-06 19:53:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21173 states. [2018-11-06 19:53:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21173 states to 21173 states and 24847 transitions. [2018-11-06 19:53:17,914 INFO L78 Accepts]: Start accepts. Automaton has 21173 states and 24847 transitions. Word has length 236 [2018-11-06 19:53:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:17,914 INFO L480 AbstractCegarLoop]: Abstraction has 21173 states and 24847 transitions. [2018-11-06 19:53:17,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:53:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 21173 states and 24847 transitions. [2018-11-06 19:53:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-06 19:53:17,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:17,934 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, 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] [2018-11-06 19:53:17,934 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:17,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 743334218, now seen corresponding path program 1 times [2018-11-06 19:53:17,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:17,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:17,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:17,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:17,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:18,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:18,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:18,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:18,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:18,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:18,543 INFO L87 Difference]: Start difference. First operand 21173 states and 24847 transitions. Second operand 4 states. [2018-11-06 19:53:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:21,156 INFO L93 Difference]: Finished difference Result 69748 states and 80897 transitions. [2018-11-06 19:53:21,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:21,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2018-11-06 19:53:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:21,223 INFO L225 Difference]: With dead ends: 69748 [2018-11-06 19:53:21,224 INFO L226 Difference]: Without dead ends: 48577 [2018-11-06 19:53:21,253 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:53:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48577 states. [2018-11-06 19:53:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48577 to 35450. [2018-11-06 19:53:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35450 states. [2018-11-06 19:53:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35450 states to 35450 states and 40732 transitions. [2018-11-06 19:53:21,810 INFO L78 Accepts]: Start accepts. Automaton has 35450 states and 40732 transitions. Word has length 240 [2018-11-06 19:53:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:21,810 INFO L480 AbstractCegarLoop]: Abstraction has 35450 states and 40732 transitions. [2018-11-06 19:53:21,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 35450 states and 40732 transitions. [2018-11-06 19:53:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-06 19:53:21,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:21,836 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:21,836 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:21,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash -772333302, now seen corresponding path program 1 times [2018-11-06 19:53:21,837 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:21,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:21,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:21,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:21,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:22,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:22,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:22,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:22,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:22,143 INFO L87 Difference]: Start difference. First operand 35450 states and 40732 transitions. Second operand 4 states. [2018-11-06 19:53:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:23,704 INFO L93 Difference]: Finished difference Result 70283 states and 80770 transitions. [2018-11-06 19:53:23,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:23,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2018-11-06 19:53:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:23,757 INFO L225 Difference]: With dead ends: 70283 [2018-11-06 19:53:23,757 INFO L226 Difference]: Without dead ends: 34835 [2018-11-06 19:53:23,790 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:53:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34835 states. [2018-11-06 19:53:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34835 to 34835. [2018-11-06 19:53:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34835 states. [2018-11-06 19:53:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34835 states to 34835 states and 38420 transitions. [2018-11-06 19:53:24,645 INFO L78 Accepts]: Start accepts. Automaton has 34835 states and 38420 transitions. Word has length 255 [2018-11-06 19:53:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:24,645 INFO L480 AbstractCegarLoop]: Abstraction has 34835 states and 38420 transitions. [2018-11-06 19:53:24,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 34835 states and 38420 transitions. [2018-11-06 19:53:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-06 19:53:24,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:24,669 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:24,669 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:24,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:24,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1969189059, now seen corresponding path program 1 times [2018-11-06 19:53:24,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:24,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:24,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:24,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:24,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 19:53:24,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:24,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:24,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:24,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:24,875 INFO L87 Difference]: Start difference. First operand 34835 states and 38420 transitions. Second operand 3 states. [2018-11-06 19:53:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:25,729 INFO L93 Difference]: Finished difference Result 69667 states and 76837 transitions. [2018-11-06 19:53:25,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:25,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2018-11-06 19:53:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:25,772 INFO L225 Difference]: With dead ends: 69667 [2018-11-06 19:53:25,773 INFO L226 Difference]: Without dead ends: 34834 [2018-11-06 19:53:25,798 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:53:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34834 states. [2018-11-06 19:53:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34834 to 34834. [2018-11-06 19:53:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34834 states. [2018-11-06 19:53:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34834 states to 34834 states and 38418 transitions. [2018-11-06 19:53:26,240 INFO L78 Accepts]: Start accepts. Automaton has 34834 states and 38418 transitions. Word has length 268 [2018-11-06 19:53:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:26,240 INFO L480 AbstractCegarLoop]: Abstraction has 34834 states and 38418 transitions. [2018-11-06 19:53:26,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 34834 states and 38418 transitions. [2018-11-06 19:53:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-06 19:53:26,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:26,264 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:26,264 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:26,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1847525715, now seen corresponding path program 1 times [2018-11-06 19:53:26,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:26,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:26,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:26,598 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 19:53:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-06 19:53:26,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:26,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:26,664 INFO L87 Difference]: Start difference. First operand 34834 states and 38418 transitions. Second operand 4 states. [2018-11-06 19:53:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:29,396 INFO L93 Difference]: Finished difference Result 126434 states and 138909 transitions. [2018-11-06 19:53:29,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:29,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-11-06 19:53:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:29,479 INFO L225 Difference]: With dead ends: 126434 [2018-11-06 19:53:29,480 INFO L226 Difference]: Without dead ends: 91602 [2018-11-06 19:53:29,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91602 states. [2018-11-06 19:53:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91602 to 91598. [2018-11-06 19:53:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91598 states. [2018-11-06 19:53:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91598 states to 91598 states and 100372 transitions. [2018-11-06 19:53:30,454 INFO L78 Accepts]: Start accepts. Automaton has 91598 states and 100372 transitions. Word has length 284 [2018-11-06 19:53:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:30,454 INFO L480 AbstractCegarLoop]: Abstraction has 91598 states and 100372 transitions. [2018-11-06 19:53:30,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 91598 states and 100372 transitions. [2018-11-06 19:53:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-06 19:53:30,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:30,468 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:30,468 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:30,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash -657631533, now seen corresponding path program 1 times [2018-11-06 19:53:30,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 19:53:30,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:30,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:30,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:30,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:30,753 INFO L87 Difference]: Start difference. First operand 91598 states and 100372 transitions. Second operand 4 states. [2018-11-06 19:53:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:33,132 INFO L93 Difference]: Finished difference Result 187108 states and 205228 transitions. [2018-11-06 19:53:33,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:33,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-11-06 19:53:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:33,253 INFO L225 Difference]: With dead ends: 187108 [2018-11-06 19:53:33,254 INFO L226 Difference]: Without dead ends: 95512 [2018-11-06 19:53:33,315 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:53:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95512 states. [2018-11-06 19:53:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95512 to 95483. [2018-11-06 19:53:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95483 states. [2018-11-06 19:53:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95483 states to 95483 states and 104575 transitions. [2018-11-06 19:53:35,016 INFO L78 Accepts]: Start accepts. Automaton has 95483 states and 104575 transitions. Word has length 284 [2018-11-06 19:53:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:35,017 INFO L480 AbstractCegarLoop]: Abstraction has 95483 states and 104575 transitions. [2018-11-06 19:53:35,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 95483 states and 104575 transitions. [2018-11-06 19:53:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-06 19:53:35,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:35,032 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:35,032 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:35,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:35,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1393560831, now seen corresponding path program 1 times [2018-11-06 19:53:35,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:35,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:35,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:35,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:35,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:35,558 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:53:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-06 19:53:35,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:35,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:35,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:53:35,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:53:35,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:35,651 INFO L87 Difference]: Start difference. First operand 95483 states and 104575 transitions. Second operand 5 states. [2018-11-06 19:53:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:39,338 INFO L93 Difference]: Finished difference Result 285047 states and 311846 transitions. [2018-11-06 19:53:39,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:53:39,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2018-11-06 19:53:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:39,556 INFO L225 Difference]: With dead ends: 285047 [2018-11-06 19:53:39,556 INFO L226 Difference]: Without dead ends: 189566 [2018-11-06 19:53:39,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189566 states. [2018-11-06 19:53:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189566 to 178242. [2018-11-06 19:53:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178242 states. [2018-11-06 19:53:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178242 states to 178242 states and 194148 transitions. [2018-11-06 19:53:42,564 INFO L78 Accepts]: Start accepts. Automaton has 178242 states and 194148 transitions. Word has length 313 [2018-11-06 19:53:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:42,564 INFO L480 AbstractCegarLoop]: Abstraction has 178242 states and 194148 transitions. [2018-11-06 19:53:42,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:53:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 178242 states and 194148 transitions. [2018-11-06 19:53:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-06 19:53:42,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:42,584 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:42,585 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:42,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -814992243, now seen corresponding path program 1 times [2018-11-06 19:53:42,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:42,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:42,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:42,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:42,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:42,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:42,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:42,941 INFO L87 Difference]: Start difference. First operand 178242 states and 194148 transitions. Second operand 4 states. [2018-11-06 19:53:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:47,233 INFO L93 Difference]: Finished difference Result 359539 states and 391686 transitions. [2018-11-06 19:53:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:47,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2018-11-06 19:53:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:47,478 INFO L225 Difference]: With dead ends: 359539 [2018-11-06 19:53:47,479 INFO L226 Difference]: Without dead ends: 181297 [2018-11-06 19:53:47,575 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:53:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181297 states. [2018-11-06 19:53:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181297 to 181289. [2018-11-06 19:53:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181289 states. [2018-11-06 19:53:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181289 states to 181289 states and 195449 transitions. [2018-11-06 19:53:49,622 INFO L78 Accepts]: Start accepts. Automaton has 181289 states and 195449 transitions. Word has length 316 [2018-11-06 19:53:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:49,622 INFO L480 AbstractCegarLoop]: Abstraction has 181289 states and 195449 transitions. [2018-11-06 19:53:49,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 181289 states and 195449 transitions. [2018-11-06 19:53:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-11-06 19:53:49,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:49,637 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:49,638 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:49,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash -337771774, now seen corresponding path program 1 times [2018-11-06 19:53:49,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:49,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:49,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:49,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:49,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-06 19:53:49,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:49,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:49,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:49,852 INFO L87 Difference]: Start difference. First operand 181289 states and 195449 transitions. Second operand 3 states. [2018-11-06 19:53:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:53,856 INFO L93 Difference]: Finished difference Result 450467 states and 485283 transitions. [2018-11-06 19:53:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:53,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2018-11-06 19:53:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:54,210 INFO L225 Difference]: With dead ends: 450467 [2018-11-06 19:53:54,210 INFO L226 Difference]: Without dead ends: 269180 [2018-11-06 19:53:54,325 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:53:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269180 states. [2018-11-06 19:54:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269180 to 258721. [2018-11-06 19:54:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258721 states. [2018-11-06 19:54:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258721 states to 258721 states and 278761 transitions. [2018-11-06 19:54:02,719 INFO L78 Accepts]: Start accepts. Automaton has 258721 states and 278761 transitions. Word has length 325 [2018-11-06 19:54:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:02,719 INFO L480 AbstractCegarLoop]: Abstraction has 258721 states and 278761 transitions. [2018-11-06 19:54:02,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 258721 states and 278761 transitions. [2018-11-06 19:54:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-06 19:54:02,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:02,733 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:02,734 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:02,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash 632149206, now seen corresponding path program 1 times [2018-11-06 19:54:02,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:02,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:02,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 143 proven. 4 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-06 19:54:03,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:54:03,776 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 19:54:03,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:03,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:54:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-06 19:54:04,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:54:04,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:54:04,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:54:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:54:04,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:54:04,076 INFO L87 Difference]: Start difference. First operand 258721 states and 278761 transitions. Second operand 6 states. [2018-11-06 19:54:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:14,646 INFO L93 Difference]: Finished difference Result 1152439 states and 1239561 transitions. [2018-11-06 19:54:14,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:54:14,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2018-11-06 19:54:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:17,230 INFO L225 Difference]: With dead ends: 1152439 [2018-11-06 19:54:17,231 INFO L226 Difference]: Without dead ends: 893720 [2018-11-06 19:54:17,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:54:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893720 states. [2018-11-06 19:54:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893720 to 888151. [2018-11-06 19:54:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888151 states. [2018-11-06 19:54:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888151 states to 888151 states and 949667 transitions. [2018-11-06 19:54:44,223 INFO L78 Accepts]: Start accepts. Automaton has 888151 states and 949667 transitions. Word has length 333 [2018-11-06 19:54:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:44,223 INFO L480 AbstractCegarLoop]: Abstraction has 888151 states and 949667 transitions. [2018-11-06 19:54:44,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:54:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 888151 states and 949667 transitions. [2018-11-06 19:54:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-06 19:54:44,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:44,248 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:54:44,248 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:44,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1755498419, now seen corresponding path program 1 times [2018-11-06 19:54:44,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:44,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:44,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:44,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:44,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:44,660 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 19:54:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-06 19:54:44,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:44,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:44,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:44,841 INFO L87 Difference]: Start difference. First operand 888151 states and 949667 transitions. Second operand 4 states. [2018-11-06 19:55:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:00,647 INFO L93 Difference]: Finished difference Result 2486026 states and 2654736 transitions. [2018-11-06 19:55:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:00,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2018-11-06 19:55:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:02,981 INFO L225 Difference]: With dead ends: 2486026 [2018-11-06 19:55:02,981 INFO L226 Difference]: Without dead ends: 1557107 [2018-11-06 19:55:03,292 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:55:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557107 states. [2018-11-06 19:55:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557107 to 1446950. [2018-11-06 19:55:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446950 states. [2018-11-06 19:55:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446950 states to 1446950 states and 1533753 transitions. [2018-11-06 19:55:47,885 INFO L78 Accepts]: Start accepts. Automaton has 1446950 states and 1533753 transitions. Word has length 334 [2018-11-06 19:55:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:47,885 INFO L480 AbstractCegarLoop]: Abstraction has 1446950 states and 1533753 transitions. [2018-11-06 19:55:47,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1446950 states and 1533753 transitions. [2018-11-06 19:55:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-06 19:55:47,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:47,895 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:55:47,896 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:47,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1403475232, now seen corresponding path program 1 times [2018-11-06 19:55:47,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:47,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:47,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:47,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:47,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:55:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:48,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:48,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:55:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:55:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:55:48,240 INFO L87 Difference]: Start difference. First operand 1446950 states and 1533753 transitions. Second operand 3 states. Received shutdown request... [2018-11-06 19:56:02,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:02,544 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:56:02,550 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:56:02,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:56:02 BoogieIcfgContainer [2018-11-06 19:56:02,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:56:02,551 INFO L168 Benchmark]: Toolchain (without parser) took 196033.49 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.0 GB). Free memory was 1.4 GB in the beginning and 4.2 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-06 19:56:02,552 INFO L168 Benchmark]: CDTParser took 0.20 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 19:56:02,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1269.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:56:02,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 316.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -890.7 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:56:02,555 INFO L168 Benchmark]: Boogie Preprocessor took 155.82 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.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:56:02,556 INFO L168 Benchmark]: RCFGBuilder took 5681.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.0 MB). Peak memory consumption was 254.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:56:02,556 INFO L168 Benchmark]: TraceAbstraction took 188603.41 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 2.0 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 19:56:02,562 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.20 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 1269.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 316.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -890.7 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.82 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.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5681.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.0 MB). Peak memory consumption was 254.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188603.41 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 2.0 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1524]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (1446950states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (513387 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 188.5s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 89.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4853 SDtfs, 11723 SDslu, 3437 SDs, 0 SdLazy, 20119 SolverSat, 3641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 359 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1446950occurred 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: 90.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 153100 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 5326 NumberOfCodeBlocks, 5326 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5305 ConstructedInterpolants, 0 QuantifiedInterpolants, 3060499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 2821/2825 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown