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_label00_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:52:24,536 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:52:24,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:52:24,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:52:24,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:52:24,561 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:52:24,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:52:24,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:52:24,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:52:24,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:52:24,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:52:24,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:52:24,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:52:24,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:52:24,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:52:24,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:52:24,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:52:24,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:52:24,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:52:24,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:52:24,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:52:24,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:52:24,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:52:24,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:52:24,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:52:24,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:52:24,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:52:24,586 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:52:24,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:52:24,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:52:24,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:52:24,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:52:24,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:52:24,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:52:24,591 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:52:24,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:52:24,592 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:24,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:52:24,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:52:24,621 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:52:24,621 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:52:24,622 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:52:24,622 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:52:24,622 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:52:24,622 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:52:24,622 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:52:24,623 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:52:24,623 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:52:24,623 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:52:24,623 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:52:24,623 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:52:24,624 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:52:24,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:52:24,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:52:24,624 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:52:24,624 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:52:24,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:24,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:52:24,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:52:24,625 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:52:24,625 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:52:24,626 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:52:24,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:52:24,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:52:24,627 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:52:24,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:52:24,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:52:24,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:52:24,701 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:52:24,702 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:52:24,702 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label00_true-unreach-call.c [2018-11-06 19:52:24,759 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7af227c/976088118604442c8945a88ef5341bd2/FLAGe526f6736 [2018-11-06 19:52:25,467 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:52:25,468 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label00_true-unreach-call.c [2018-11-06 19:52:25,486 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7af227c/976088118604442c8945a88ef5341bd2/FLAGe526f6736 [2018-11-06 19:52:25,503 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7af227c/976088118604442c8945a88ef5341bd2 [2018-11-06 19:52:25,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:52:25,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:52:25,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:25,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:52:25,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:52:25,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:25" (1/1) ... [2018-11-06 19:52:25,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cedeeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:25, skipping insertion in model container [2018-11-06 19:52:25,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:25" (1/1) ... [2018-11-06 19:52:25,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:52:25,642 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:52:26,379 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:26,385 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:52:26,658 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:26,687 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:52:26,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:26 WrapperNode [2018-11-06 19:52:26,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:26,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:26,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:52:26,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:52:26,702 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:26" (1/1) ... [2018-11-06 19:52:26,895 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:26" (1/1) ... [2018-11-06 19:52:27,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:27,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:52:27,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:52:27,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:52:27,036 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:26" (1/1) ... [2018-11-06 19:52:27,036 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:26" (1/1) ... [2018-11-06 19:52:27,045 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:26" (1/1) ... [2018-11-06 19:52:27,045 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:26" (1/1) ... [2018-11-06 19:52:27,108 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:26" (1/1) ... [2018-11-06 19:52:27,140 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:26" (1/1) ... [2018-11-06 19:52:27,159 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:26" (1/1) ... [2018-11-06 19:52:27,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:52:27,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:52:27,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:52:27,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:52:27,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:26" (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:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:52:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:52:27,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:52:32,971 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:52:32,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:32 BoogieIcfgContainer [2018-11-06 19:52:32,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:52:32,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:52:32,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:52:32,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:52:32,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:52:25" (1/3) ... [2018-11-06 19:52:32,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c5135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:32, skipping insertion in model container [2018-11-06 19:52:32,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:26" (2/3) ... [2018-11-06 19:52:32,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c5135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:32, skipping insertion in model container [2018-11-06 19:52:32,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:32" (3/3) ... [2018-11-06 19:52:32,981 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label00_true-unreach-call.c [2018-11-06 19:52:32,991 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:52:33,010 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:52:33,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:52:33,075 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:52:33,076 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:52:33,076 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:52:33,076 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:52:33,076 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:52:33,077 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:52:33,077 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:52:33,077 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:52:33,077 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:52:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:52:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-06 19:52:33,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:33,127 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:33,130 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:33,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash -140925822, now seen corresponding path program 1 times [2018-11-06 19:52:33,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:33,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:33,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:34,206 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:34,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:34,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:34,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:34,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:34,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:34,237 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:52:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:37,774 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-11-06 19:52:37,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:37,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2018-11-06 19:52:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:37,805 INFO L225 Difference]: With dead ends: 1027 [2018-11-06 19:52:37,806 INFO L226 Difference]: Without dead ends: 717 [2018-11-06 19:52:37,810 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:52:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-11-06 19:52:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-11-06 19:52:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-06 19:52:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-11-06 19:52:37,898 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 193 [2018-11-06 19:52:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:37,899 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-11-06 19:52:37,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-11-06 19:52:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-06 19:52:37,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:37,907 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:37,908 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:37,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash -85332637, now seen corresponding path program 1 times [2018-11-06 19:52:37,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:37,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:37,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:37,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:37,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:38,048 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:52:38,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:38,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:38,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:38,052 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-11-06 19:52:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:39,798 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-11-06 19:52:39,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:39,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-11-06 19:52:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:39,807 INFO L225 Difference]: With dead ends: 2058 [2018-11-06 19:52:39,807 INFO L226 Difference]: Without dead ends: 1345 [2018-11-06 19:52:39,811 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:52:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-11-06 19:52:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-11-06 19:52:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-11-06 19:52:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-11-06 19:52:39,872 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 202 [2018-11-06 19:52:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:39,873 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-11-06 19:52:39,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-11-06 19:52:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-06 19:52:39,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:39,878 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:39,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:39,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1441718287, now seen corresponding path program 1 times [2018-11-06 19:52:39,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:39,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:40,181 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:52:40,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:40,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:40,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:40,183 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-11-06 19:52:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:43,917 INFO L93 Difference]: Finished difference Result 3901 states and 6135 transitions. [2018-11-06 19:52:43,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:43,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-11-06 19:52:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:43,934 INFO L225 Difference]: With dead ends: 3901 [2018-11-06 19:52:43,934 INFO L226 Difference]: Without dead ends: 2572 [2018-11-06 19:52:43,938 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:52:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2018-11-06 19:52:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2558. [2018-11-06 19:52:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-11-06 19:52:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3854 transitions. [2018-11-06 19:52:43,996 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3854 transitions. Word has length 210 [2018-11-06 19:52:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:43,998 INFO L480 AbstractCegarLoop]: Abstraction has 2558 states and 3854 transitions. [2018-11-06 19:52:43,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3854 transitions. [2018-11-06 19:52:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-06 19:52:44,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:44,007 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:44,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:44,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:44,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1369914862, now seen corresponding path program 1 times [2018-11-06 19:52:44,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:44,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:44,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:44,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:44,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:52:44,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:44,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:44,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:44,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:44,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:44,176 INFO L87 Difference]: Start difference. First operand 2558 states and 3854 transitions. Second operand 3 states. [2018-11-06 19:52:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:44,965 INFO L93 Difference]: Finished difference Result 5091 states and 7675 transitions. [2018-11-06 19:52:44,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:44,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-11-06 19:52:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:44,979 INFO L225 Difference]: With dead ends: 5091 [2018-11-06 19:52:44,980 INFO L226 Difference]: Without dead ends: 2535 [2018-11-06 19:52:44,984 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:52:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-11-06 19:52:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2535. [2018-11-06 19:52:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2018-11-06 19:52:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3747 transitions. [2018-11-06 19:52:45,038 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3747 transitions. Word has length 224 [2018-11-06 19:52:45,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:45,039 INFO L480 AbstractCegarLoop]: Abstraction has 2535 states and 3747 transitions. [2018-11-06 19:52:45,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3747 transitions. [2018-11-06 19:52:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-06 19:52:45,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:45,047 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:45,048 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:45,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash 356198142, now seen corresponding path program 1 times [2018-11-06 19:52:45,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:45,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:45,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:45,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:45,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:52:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:45,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:45,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:45,311 INFO L87 Difference]: Start difference. First operand 2535 states and 3747 transitions. Second operand 3 states. [2018-11-06 19:52:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:46,898 INFO L93 Difference]: Finished difference Result 7314 states and 10763 transitions. [2018-11-06 19:52:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:46,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-11-06 19:52:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:46,919 INFO L225 Difference]: With dead ends: 7314 [2018-11-06 19:52:46,920 INFO L226 Difference]: Without dead ends: 4781 [2018-11-06 19:52:46,924 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:52:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2018-11-06 19:52:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2018-11-06 19:52:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2018-11-06 19:52:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6617 transitions. [2018-11-06 19:52:47,007 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6617 transitions. Word has length 245 [2018-11-06 19:52:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:47,007 INFO L480 AbstractCegarLoop]: Abstraction has 4778 states and 6617 transitions. [2018-11-06 19:52:47,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6617 transitions. [2018-11-06 19:52:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-06 19:52:47,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:47,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,019 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:47,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1504104924, now seen corresponding path program 1 times [2018-11-06 19:52:47,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:47,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:47,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:47,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:47,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:47,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:47,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:47,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:47,358 INFO L87 Difference]: Start difference. First operand 4778 states and 6617 transitions. Second operand 4 states. [2018-11-06 19:52:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:50,583 INFO L93 Difference]: Finished difference Result 17750 states and 24441 transitions. [2018-11-06 19:52:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:50,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-11-06 19:52:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:50,628 INFO L225 Difference]: With dead ends: 17750 [2018-11-06 19:52:50,629 INFO L226 Difference]: Without dead ends: 12974 [2018-11-06 19:52:50,638 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:52:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12974 states. [2018-11-06 19:52:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12974 to 9063. [2018-11-06 19:52:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-11-06 19:52:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 11954 transitions. [2018-11-06 19:52:50,800 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 11954 transitions. Word has length 248 [2018-11-06 19:52:50,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:50,801 INFO L480 AbstractCegarLoop]: Abstraction has 9063 states and 11954 transitions. [2018-11-06 19:52:50,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 11954 transitions. [2018-11-06 19:52:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-06 19:52:50,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:50,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,821 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:50,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash 394890776, now seen corresponding path program 1 times [2018-11-06 19:52:50,821 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:50,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:50,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:52:51,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:51,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:51,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:51,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:51,048 INFO L87 Difference]: Start difference. First operand 9063 states and 11954 transitions. Second operand 3 states. [2018-11-06 19:52:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:52,557 INFO L93 Difference]: Finished difference Result 26082 states and 34266 transitions. [2018-11-06 19:52:52,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:52,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2018-11-06 19:52:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:52,599 INFO L225 Difference]: With dead ends: 26082 [2018-11-06 19:52:52,599 INFO L226 Difference]: Without dead ends: 17021 [2018-11-06 19:52:52,611 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:52:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17021 states. [2018-11-06 19:52:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17021 to 17020. [2018-11-06 19:52:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-11-06 19:52:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 21216 transitions. [2018-11-06 19:52:52,835 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 21216 transitions. Word has length 272 [2018-11-06 19:52:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:52,835 INFO L480 AbstractCegarLoop]: Abstraction has 17020 states and 21216 transitions. [2018-11-06 19:52:52,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 21216 transitions. [2018-11-06 19:52:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-06 19:52:52,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:52,868 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:52,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:52,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1396159378, now seen corresponding path program 1 times [2018-11-06 19:52:52,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:52,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:52,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:52,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:52,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 19:52:53,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:53,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:53,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:53,003 INFO L87 Difference]: Start difference. First operand 17020 states and 21216 transitions. Second operand 3 states. [2018-11-06 19:52:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:54,447 INFO L93 Difference]: Finished difference Result 34041 states and 42435 transitions. [2018-11-06 19:52:54,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:54,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-06 19:52:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:54,478 INFO L225 Difference]: With dead ends: 34041 [2018-11-06 19:52:54,479 INFO L226 Difference]: Without dead ends: 17023 [2018-11-06 19:52:54,498 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:52:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17023 states. [2018-11-06 19:52:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17023 to 17020. [2018-11-06 19:52:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-11-06 19:52:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 19940 transitions. [2018-11-06 19:52:54,703 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 19940 transitions. Word has length 279 [2018-11-06 19:52:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:54,703 INFO L480 AbstractCegarLoop]: Abstraction has 17020 states and 19940 transitions. [2018-11-06 19:52:54,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 19940 transitions. [2018-11-06 19:52:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-06 19:52:54,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:54,731 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:54,731 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:54,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:54,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1920303954, now seen corresponding path program 1 times [2018-11-06 19:52:54,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:54,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:54,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:54,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:54,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 19:52:54,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:54,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:54,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:54,957 INFO L87 Difference]: Start difference. First operand 17020 states and 19940 transitions. Second operand 3 states. [2018-11-06 19:52:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:57,428 INFO L93 Difference]: Finished difference Result 43268 states and 50595 transitions. [2018-11-06 19:52:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:57,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2018-11-06 19:52:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:57,466 INFO L225 Difference]: With dead ends: 43268 [2018-11-06 19:52:57,467 INFO L226 Difference]: Without dead ends: 26250 [2018-11-06 19:52:57,484 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:52:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26250 states. [2018-11-06 19:52:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26250 to 26246. [2018-11-06 19:52:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26246 states. [2018-11-06 19:52:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26246 states to 26246 states and 30594 transitions. [2018-11-06 19:52:57,796 INFO L78 Accepts]: Start accepts. Automaton has 26246 states and 30594 transitions. Word has length 288 [2018-11-06 19:52:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:57,797 INFO L480 AbstractCegarLoop]: Abstraction has 26246 states and 30594 transitions. [2018-11-06 19:52:57,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 26246 states and 30594 transitions. [2018-11-06 19:52:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-06 19:52:57,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:57,833 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:57,833 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:57,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1014461186, now seen corresponding path program 1 times [2018-11-06 19:52:57,834 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:57,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:57,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:57,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:57,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:58,180 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:52:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 19:52:58,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:52:58,334 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:52:58,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:58,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:52:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-06 19:52:58,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:52:58,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 19:52:58,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:52:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:52:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:52:58,682 INFO L87 Difference]: Start difference. First operand 26246 states and 30594 transitions. Second operand 6 states. [2018-11-06 19:52:59,217 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 19:53:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:05,174 INFO L93 Difference]: Finished difference Result 92652 states and 108452 transitions. [2018-11-06 19:53:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:53:05,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 296 [2018-11-06 19:53:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:05,274 INFO L225 Difference]: With dead ends: 92652 [2018-11-06 19:53:05,274 INFO L226 Difference]: Without dead ends: 66408 [2018-11-06 19:53:05,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:53:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66408 states. [2018-11-06 19:53:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66408 to 66395. [2018-11-06 19:53:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66395 states. [2018-11-06 19:53:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66395 states to 66395 states and 74051 transitions. [2018-11-06 19:53:06,360 INFO L78 Accepts]: Start accepts. Automaton has 66395 states and 74051 transitions. Word has length 296 [2018-11-06 19:53:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:06,360 INFO L480 AbstractCegarLoop]: Abstraction has 66395 states and 74051 transitions. [2018-11-06 19:53:06,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:53:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 66395 states and 74051 transitions. [2018-11-06 19:53:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-06 19:53:06,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:06,404 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:06,404 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:06,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash 75966581, now seen corresponding path program 1 times [2018-11-06 19:53:06,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:06,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:06,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:06,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:06,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:06,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:06,754 INFO L87 Difference]: Start difference. First operand 66395 states and 74051 transitions. Second operand 3 states. [2018-11-06 19:53:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:09,149 INFO L93 Difference]: Finished difference Result 172563 states and 192282 transitions. [2018-11-06 19:53:09,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:09,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-11-06 19:53:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:09,821 INFO L225 Difference]: With dead ends: 172563 [2018-11-06 19:53:09,821 INFO L226 Difference]: Without dead ends: 106170 [2018-11-06 19:53:09,861 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:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106170 states. [2018-11-06 19:53:11,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106170 to 106165. [2018-11-06 19:53:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106165 states. [2018-11-06 19:53:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106165 states to 106165 states and 118120 transitions. [2018-11-06 19:53:11,195 INFO L78 Accepts]: Start accepts. Automaton has 106165 states and 118120 transitions. Word has length 309 [2018-11-06 19:53:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:11,196 INFO L480 AbstractCegarLoop]: Abstraction has 106165 states and 118120 transitions. [2018-11-06 19:53:11,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 106165 states and 118120 transitions. [2018-11-06 19:53:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-06 19:53:11,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:11,233 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:11,234 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:11,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1119691337, now seen corresponding path program 1 times [2018-11-06 19:53:11,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:11,628 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:53:12,211 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-11-06 19:53:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:12,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:12,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-06 19:53:12,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 19:53:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 19:53:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:53:12,675 INFO L87 Difference]: Start difference. First operand 106165 states and 118120 transitions. Second operand 11 states. [2018-11-06 19:53:13,158 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-11-06 19:53:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:19,934 INFO L93 Difference]: Finished difference Result 316695 states and 350556 transitions. [2018-11-06 19:53:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:53:19,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 317 [2018-11-06 19:53:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:20,218 INFO L225 Difference]: With dead ends: 316695 [2018-11-06 19:53:20,218 INFO L226 Difference]: Without dead ends: 210532 [2018-11-06 19:53:20,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-11-06 19:53:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210532 states. [2018-11-06 19:53:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210532 to 208205. [2018-11-06 19:53:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208205 states. [2018-11-06 19:53:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208205 states to 208205 states and 229907 transitions. [2018-11-06 19:53:23,358 INFO L78 Accepts]: Start accepts. Automaton has 208205 states and 229907 transitions. Word has length 317 [2018-11-06 19:53:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:23,358 INFO L480 AbstractCegarLoop]: Abstraction has 208205 states and 229907 transitions. [2018-11-06 19:53:23,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 19:53:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 208205 states and 229907 transitions. [2018-11-06 19:53:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-11-06 19:53:23,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:23,443 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,443 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:23,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:23,444 INFO L82 PathProgramCache]: Analyzing trace with hash 638448842, now seen corresponding path program 1 times [2018-11-06 19:53:23,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:23,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:23,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-06 19:53:23,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:23,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:23,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:23,748 INFO L87 Difference]: Start difference. First operand 208205 states and 229907 transitions. Second operand 4 states. [2018-11-06 19:53:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:28,369 INFO L93 Difference]: Finished difference Result 611371 states and 673474 transitions. [2018-11-06 19:53:28,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:28,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-11-06 19:53:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:28,844 INFO L225 Difference]: With dead ends: 611371 [2018-11-06 19:53:28,844 INFO L226 Difference]: Without dead ends: 403168 [2018-11-06 19:53:28,978 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:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403168 states. [2018-11-06 19:53:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403168 to 398428. [2018-11-06 19:53:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398428 states. [2018-11-06 19:53:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398428 states to 398428 states and 438317 transitions. [2018-11-06 19:53:43,218 INFO L78 Accepts]: Start accepts. Automaton has 398428 states and 438317 transitions. Word has length 352 [2018-11-06 19:53:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:43,218 INFO L480 AbstractCegarLoop]: Abstraction has 398428 states and 438317 transitions. [2018-11-06 19:53:43,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 398428 states and 438317 transitions. [2018-11-06 19:53:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-11-06 19:53:43,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:43,387 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:43,387 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:43,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1588013163, now seen corresponding path program 1 times [2018-11-06 19:53:43,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:43,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-06 19:53:43,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:43,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:43,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:43,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:43,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:43,775 INFO L87 Difference]: Start difference. First operand 398428 states and 438317 transitions. Second operand 4 states. [2018-11-06 19:53:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:48,572 INFO L93 Difference]: Finished difference Result 788779 states and 868194 transitions. [2018-11-06 19:53:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:48,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2018-11-06 19:53:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:49,040 INFO L225 Difference]: With dead ends: 788779 [2018-11-06 19:53:49,040 INFO L226 Difference]: Without dead ends: 390353 [2018-11-06 19:53:49,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390353 states. [2018-11-06 19:53:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390353 to 389413. [2018-11-06 19:53:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389413 states. [2018-11-06 19:53:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389413 states to 389413 states and 426656 transitions. [2018-11-06 19:53:56,207 INFO L78 Accepts]: Start accepts. Automaton has 389413 states and 426656 transitions. Word has length 407 [2018-11-06 19:53:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:56,207 INFO L480 AbstractCegarLoop]: Abstraction has 389413 states and 426656 transitions. [2018-11-06 19:53:56,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 389413 states and 426656 transitions. [2018-11-06 19:53:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-11-06 19:53:56,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:56,367 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,367 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:56,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1713250798, now seen corresponding path program 1 times [2018-11-06 19:53:56,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:56,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:56,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-06 19:53:57,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:57,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:57,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:57,986 INFO L87 Difference]: Start difference. First operand 389413 states and 426656 transitions. Second operand 4 states. [2018-11-06 19:54:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:02,400 INFO L93 Difference]: Finished difference Result 778894 states and 853437 transitions. [2018-11-06 19:54:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:54:02,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2018-11-06 19:54:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:10,087 INFO L225 Difference]: With dead ends: 778894 [2018-11-06 19:54:10,087 INFO L226 Difference]: Without dead ends: 389483 [2018-11-06 19:54:10,293 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:54:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389483 states. [2018-11-06 19:54:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389483 to 389413. [2018-11-06 19:54:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389413 states. [2018-11-06 19:54:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389413 states to 389413 states and 422300 transitions. [2018-11-06 19:54:15,305 INFO L78 Accepts]: Start accepts. Automaton has 389413 states and 422300 transitions. Word has length 421 [2018-11-06 19:54:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:15,305 INFO L480 AbstractCegarLoop]: Abstraction has 389413 states and 422300 transitions. [2018-11-06 19:54:15,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 389413 states and 422300 transitions. [2018-11-06 19:54:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-11-06 19:54:15,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:15,485 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,485 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:15,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:15,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1675745500, now seen corresponding path program 1 times [2018-11-06 19:54:15,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:15,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:15,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:15,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:15,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-06 19:54:15,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:15,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:15,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:15,796 INFO L87 Difference]: Start difference. First operand 389413 states and 422300 transitions. Second operand 3 states. [2018-11-06 19:54:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:20,755 INFO L93 Difference]: Finished difference Result 726612 states and 789610 transitions. [2018-11-06 19:54:20,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:20,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 428 [2018-11-06 19:54:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:21,152 INFO L225 Difference]: With dead ends: 726612 [2018-11-06 19:54:21,153 INFO L226 Difference]: Without dead ends: 337201 [2018-11-06 19:54:21,351 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:54:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337201 states. [2018-11-06 19:54:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337201 to 333900. [2018-11-06 19:54:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333900 states. [2018-11-06 19:54:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333900 states to 333900 states and 361760 transitions. [2018-11-06 19:54:27,780 INFO L78 Accepts]: Start accepts. Automaton has 333900 states and 361760 transitions. Word has length 428 [2018-11-06 19:54:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:27,781 INFO L480 AbstractCegarLoop]: Abstraction has 333900 states and 361760 transitions. [2018-11-06 19:54:27,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 333900 states and 361760 transitions. [2018-11-06 19:54:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-11-06 19:54:28,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:28,007 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,007 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:28,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1325914097, now seen corresponding path program 1 times [2018-11-06 19:54:28,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:28,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:28,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:28,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-11-06 19:54:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:29,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:29,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:29,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:29,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:29,488 INFO L87 Difference]: Start difference. First operand 333900 states and 361760 transitions. Second operand 4 states. [2018-11-06 19:54:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:35,247 INFO L93 Difference]: Finished difference Result 686819 states and 744054 transitions. [2018-11-06 19:54:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:54:35,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-11-06 19:54:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:35,756 INFO L225 Difference]: With dead ends: 686819 [2018-11-06 19:54:35,756 INFO L226 Difference]: Without dead ends: 352921 [2018-11-06 19:54:35,949 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:54:36,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352921 states. [2018-11-06 19:54:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352921 to 349616. [2018-11-06 19:54:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349616 states. [2018-11-06 19:54:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349616 states to 349616 states and 376657 transitions. [2018-11-06 19:54:46,986 INFO L78 Accepts]: Start accepts. Automaton has 349616 states and 376657 transitions. Word has length 505 [2018-11-06 19:54:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:46,986 INFO L480 AbstractCegarLoop]: Abstraction has 349616 states and 376657 transitions. [2018-11-06 19:54:46,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 349616 states and 376657 transitions. [2018-11-06 19:54:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-11-06 19:54:47,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:47,200 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:54:47,200 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:47,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash 300999508, now seen corresponding path program 1 times [2018-11-06 19:54:47,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:47,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-11-06 19:54:47,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:47,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:47,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:47,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:47,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:47,656 INFO L87 Difference]: Start difference. First operand 349616 states and 376657 transitions. Second operand 4 states. [2018-11-06 19:54:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:55,465 INFO L93 Difference]: Finished difference Result 1242314 states and 1338493 transitions. [2018-11-06 19:54:55,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:54:55,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2018-11-06 19:54:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:56,773 INFO L225 Difference]: With dead ends: 1242314 [2018-11-06 19:54:56,773 INFO L226 Difference]: Without dead ends: 892700 [2018-11-06 19:54:56,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892700 states. [2018-11-06 19:55:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892700 to 563316. [2018-11-06 19:55:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563316 states. [2018-11-06 19:55:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563316 states to 563316 states and 607091 transitions. [2018-11-06 19:55:08,688 INFO L78 Accepts]: Start accepts. Automaton has 563316 states and 607091 transitions. Word has length 518 [2018-11-06 19:55:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:08,689 INFO L480 AbstractCegarLoop]: Abstraction has 563316 states and 607091 transitions. [2018-11-06 19:55:08,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 563316 states and 607091 transitions. [2018-11-06 19:55:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-11-06 19:55:08,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:08,907 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:55:08,908 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:08,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash 196498271, now seen corresponding path program 1 times [2018-11-06 19:55:08,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:08,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:08,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:08,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:08,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-11-06 19:55:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:09,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:09,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:09,470 INFO L87 Difference]: Start difference. First operand 563316 states and 607091 transitions. Second operand 4 states. [2018-11-06 19:55:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:26,322 INFO L93 Difference]: Finished difference Result 1620908 states and 1746208 transitions. [2018-11-06 19:55:26,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:26,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 540 [2018-11-06 19:55:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:28,790 INFO L225 Difference]: With dead ends: 1620908 [2018-11-06 19:55:28,790 INFO L226 Difference]: Without dead ends: 1057594 [2018-11-06 19:55:28,993 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:29,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057594 states. [2018-11-06 19:55:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057594 to 1022783. [2018-11-06 19:55:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022783 states. [2018-11-06 19:55:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022783 states to 1022783 states and 1103014 transitions. [2018-11-06 19:55:46,027 INFO L78 Accepts]: Start accepts. Automaton has 1022783 states and 1103014 transitions. Word has length 540 [2018-11-06 19:55:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:46,028 INFO L480 AbstractCegarLoop]: Abstraction has 1022783 states and 1103014 transitions. [2018-11-06 19:55:46,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1022783 states and 1103014 transitions. Received shutdown request... [2018-11-06 19:55:48,042 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:55:48,046 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:55:48,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:55:48 BoogieIcfgContainer [2018-11-06 19:55:48,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:55:48,048 INFO L168 Benchmark]: Toolchain (without parser) took 202530.01 ms. Allocated memory was 1.5 GB in the beginning and 6.0 GB in the end (delta: 4.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-11-06 19:55:48,049 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:55:48,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1168.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:48,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 332.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -858.1 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:48,051 INFO L168 Benchmark]: Boogie Preprocessor took 146.81 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:55:48,052 INFO L168 Benchmark]: RCFGBuilder took 5801.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 270.5 MB). Peak memory consumption was 270.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:48,052 INFO L168 Benchmark]: TraceAbstraction took 195073.69 ms. Allocated memory was 2.3 GB in the beginning and 6.0 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -506.5 MB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. [2018-11-06 19:55:48,057 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1168.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 332.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -858.1 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.81 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5801.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 270.5 MB). Peak memory consumption was 270.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195073.69 ms. Allocated memory was 2.3 GB in the beginning and 6.0 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -506.5 MB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1611]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1611). Cancelled while IsEmpty was searching accepting run (input had 1022783 states). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 194.9s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 101.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4559 SDtfs, 11069 SDslu, 2888 SDs, 0 SdLazy, 18422 SolverSat, 3714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1022783occurred 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: 79.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 382848 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 6550 NumberOfCodeBlocks, 6550 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 6530 ConstructedInterpolants, 0 QuantifiedInterpolants, 6540273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 4483/4487 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown