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_label18_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:55:50,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:55:50,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:55:50,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:55:50,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:55:50,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:55:50,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:55:50,577 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:55:50,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:55:50,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:55:50,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:55:50,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:55:50,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:55:50,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:55:50,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:55:50,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:55:50,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:55:50,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:55:50,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:55:50,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:55:50,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:55:50,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:55:50,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:55:50,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:55:50,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:55:50,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:55:50,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:55:50,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:55:50,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:55:50,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:55:50,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:55:50,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:55:50,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:55:50,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:55:50,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:55:50,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:55:50,605 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:55:50,623 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:55:50,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:55:50,624 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:55:50,625 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:55:50,626 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:55:50,626 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:55:50,626 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:55:50,627 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:55:50,627 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:55:50,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:55:50,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:55:50,628 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:55:50,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:55:50,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:55:50,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:55:50,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:55:50,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:55:50,630 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:55:50,630 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:55:50,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:55:50,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:55:50,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:55:50,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:55:50,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:55:50,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:55:50,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:55:50,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:55:50,632 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:55:50,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:55:50,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:55:50,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:55:50,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:55:50,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:55:50,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label18_true-unreach-call.c [2018-11-06 19:55:50,765 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6abcc86/5decde94c26240f194c82e7917a1fe96/FLAG881109e21 [2018-11-06 19:55:51,523 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:55:51,524 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label18_true-unreach-call.c [2018-11-06 19:55:51,542 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6abcc86/5decde94c26240f194c82e7917a1fe96/FLAG881109e21 [2018-11-06 19:55:51,563 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6abcc86/5decde94c26240f194c82e7917a1fe96 [2018-11-06 19:55:51,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:55:51,578 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:55:51,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:55:51,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:55:51,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:55:51,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56927dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51, skipping insertion in model container [2018-11-06 19:55:51,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:55:51,691 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:55:52,500 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:55:52,506 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:55:52,779 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:55:52,803 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:55:52,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52 WrapperNode [2018-11-06 19:55:52,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:55:52,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:55:52,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:55:52,805 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:55:52,818 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:55:52" (1/1) ... [2018-11-06 19:55:53,009 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:55:52" (1/1) ... [2018-11-06 19:55:53,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:55:53,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:55:53,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:55:53,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:55:53,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (1/1) ... [2018-11-06 19:55:53,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (1/1) ... [2018-11-06 19:55:53,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (1/1) ... [2018-11-06 19:55:53,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (1/1) ... [2018-11-06 19:55:53,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (1/1) ... [2018-11-06 19:55:53,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (1/1) ... [2018-11-06 19:55:53,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (1/1) ... [2018-11-06 19:55:53,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:55:53,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:55:53,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:55:53,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:55:53,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (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:55:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:55:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:55:53,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:55:58,976 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:55:58,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:58 BoogieIcfgContainer [2018-11-06 19:55:58,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:55:58,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:55:58,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:55:58,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:55:58,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:55:51" (1/3) ... [2018-11-06 19:55:58,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ed6df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:55:58, skipping insertion in model container [2018-11-06 19:55:58,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:52" (2/3) ... [2018-11-06 19:55:58,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ed6df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:55:58, skipping insertion in model container [2018-11-06 19:55:58,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:58" (3/3) ... [2018-11-06 19:55:58,987 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label18_true-unreach-call.c [2018-11-06 19:55:58,999 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:55:59,007 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:55:59,024 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:55:59,061 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:55:59,062 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:55:59,062 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:55:59,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:55:59,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:55:59,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:55:59,062 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:55:59,063 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:55:59,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:55:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:55:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-06 19:55:59,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:59,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:55:59,115 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:59,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash 249501988, now seen corresponding path program 1 times [2018-11-06 19:55:59,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:59,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:59,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:59,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:59,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:00,126 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:56:00,249 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:56:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:00,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:00,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:00,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:00,281 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:56:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:03,882 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-11-06 19:56:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:03,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2018-11-06 19:56:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:03,910 INFO L225 Difference]: With dead ends: 1079 [2018-11-06 19:56:03,911 INFO L226 Difference]: Without dead ends: 769 [2018-11-06 19:56:03,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-11-06 19:56:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-11-06 19:56:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-06 19:56:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-11-06 19:56:04,012 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 204 [2018-11-06 19:56:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:04,013 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-11-06 19:56:04,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-11-06 19:56:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-06 19:56:04,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:04,021 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:04,021 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:04,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:04,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1825298013, now seen corresponding path program 1 times [2018-11-06 19:56:04,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:04,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:04,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:04,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:04,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:04,177 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:56:04,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:04,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:04,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:04,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:04,181 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-11-06 19:56:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:06,506 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-11-06 19:56:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:06,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-11-06 19:56:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:06,513 INFO L225 Difference]: With dead ends: 1449 [2018-11-06 19:56:06,514 INFO L226 Difference]: Without dead ends: 938 [2018-11-06 19:56:06,516 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:56:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-11-06 19:56:06,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-11-06 19:56:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-06 19:56:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-11-06 19:56:06,544 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 213 [2018-11-06 19:56:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:06,545 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-11-06 19:56:06,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-11-06 19:56:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-06 19:56:06,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:06,551 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:06,552 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:06,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1480782977, now seen corresponding path program 1 times [2018-11-06 19:56:06,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:06,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:06,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:06,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:06,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:06,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:06,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:06,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:06,684 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-11-06 19:56:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:09,015 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-11-06 19:56:09,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:09,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-11-06 19:56:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:09,021 INFO L225 Difference]: With dead ends: 1823 [2018-11-06 19:56:09,021 INFO L226 Difference]: Without dead ends: 902 [2018-11-06 19:56:09,023 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:56:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-11-06 19:56:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-11-06 19:56:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-11-06 19:56:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-11-06 19:56:09,045 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 218 [2018-11-06 19:56:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:09,046 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-11-06 19:56:09,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-11-06 19:56:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-06 19:56:09,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:09,051 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,051 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:09,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash 11850556, now seen corresponding path program 1 times [2018-11-06 19:56:09,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:09,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:09,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 19:56:09,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:09,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:09,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:09,220 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-11-06 19:56:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:12,949 INFO L93 Difference]: Finished difference Result 3476 states and 5598 transitions. [2018-11-06 19:56:12,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:12,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-11-06 19:56:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:12,969 INFO L225 Difference]: With dead ends: 3476 [2018-11-06 19:56:12,969 INFO L226 Difference]: Without dead ends: 2576 [2018-11-06 19:56:12,972 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-11-06 19:56:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1723. [2018-11-06 19:56:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-11-06 19:56:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-11-06 19:56:13,027 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 220 [2018-11-06 19:56:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:13,028 INFO L480 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-11-06 19:56:13,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-11-06 19:56:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-06 19:56:13,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:13,035 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:13,035 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:13,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1757886552, now seen corresponding path program 1 times [2018-11-06 19:56:13,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:13,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:13,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:56:13,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:13,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:13,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:13,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:13,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:13,219 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-11-06 19:56:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:13,731 INFO L93 Difference]: Finished difference Result 5159 states and 7797 transitions. [2018-11-06 19:56:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:13,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-11-06 19:56:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:13,749 INFO L225 Difference]: With dead ends: 5159 [2018-11-06 19:56:13,749 INFO L226 Difference]: Without dead ends: 3438 [2018-11-06 19:56:13,753 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:56:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2018-11-06 19:56:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3436. [2018-11-06 19:56:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-11-06 19:56:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5189 transitions. [2018-11-06 19:56:13,831 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5189 transitions. Word has length 227 [2018-11-06 19:56:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:13,832 INFO L480 AbstractCegarLoop]: Abstraction has 3436 states and 5189 transitions. [2018-11-06 19:56:13,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5189 transitions. [2018-11-06 19:56:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-06 19:56:13,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:13,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,840 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:13,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2090114336, now seen corresponding path program 1 times [2018-11-06 19:56:13,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:13,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:14,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:14,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:56:14,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:56:14,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:56:14,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:14,044 INFO L87 Difference]: Start difference. First operand 3436 states and 5189 transitions. Second operand 5 states. [2018-11-06 19:56:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:16,985 INFO L93 Difference]: Finished difference Result 7939 states and 12127 transitions. [2018-11-06 19:56:16,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:56:16,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2018-11-06 19:56:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:17,003 INFO L225 Difference]: With dead ends: 7939 [2018-11-06 19:56:17,004 INFO L226 Difference]: Without dead ends: 4505 [2018-11-06 19:56:17,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2018-11-06 19:56:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3640. [2018-11-06 19:56:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3640 states. [2018-11-06 19:56:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5424 transitions. [2018-11-06 19:56:17,087 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5424 transitions. Word has length 244 [2018-11-06 19:56:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:17,088 INFO L480 AbstractCegarLoop]: Abstraction has 3640 states and 5424 transitions. [2018-11-06 19:56:17,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:56:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5424 transitions. [2018-11-06 19:56:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-06 19:56:17,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:17,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:17,097 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:17,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1437860204, now seen corresponding path program 1 times [2018-11-06 19:56:17,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:17,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:17,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:17,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:17,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:17,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:17,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:17,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:17,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:17,333 INFO L87 Difference]: Start difference. First operand 3640 states and 5424 transitions. Second operand 3 states. [2018-11-06 19:56:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:18,775 INFO L93 Difference]: Finished difference Result 8933 states and 13269 transitions. [2018-11-06 19:56:18,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:18,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-06 19:56:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:18,794 INFO L225 Difference]: With dead ends: 8933 [2018-11-06 19:56:18,794 INFO L226 Difference]: Without dead ends: 5295 [2018-11-06 19:56:18,801 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2018-11-06 19:56:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5293. [2018-11-06 19:56:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-11-06 19:56:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7795 transitions. [2018-11-06 19:56:18,929 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7795 transitions. Word has length 246 [2018-11-06 19:56:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:18,930 INFO L480 AbstractCegarLoop]: Abstraction has 5293 states and 7795 transitions. [2018-11-06 19:56:18,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7795 transitions. [2018-11-06 19:56:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-06 19:56:18,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:18,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:18,943 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:18,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:18,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1798348608, now seen corresponding path program 1 times [2018-11-06 19:56:18,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:18,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:18,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:18,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:18,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:19,449 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-06 19:56:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:19,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:56:19,523 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:56:19,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:19,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:56:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:19,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:56:19,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:56:19,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:56:19,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:56:19,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:56:19,918 INFO L87 Difference]: Start difference. First operand 5293 states and 7795 transitions. Second operand 7 states. [2018-11-06 19:56:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:25,187 INFO L93 Difference]: Finished difference Result 23061 states and 33566 transitions. [2018-11-06 19:56:25,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:56:25,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 254 [2018-11-06 19:56:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:25,245 INFO L225 Difference]: With dead ends: 23061 [2018-11-06 19:56:25,245 INFO L226 Difference]: Without dead ends: 17770 [2018-11-06 19:56:25,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:56:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2018-11-06 19:56:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17766. [2018-11-06 19:56:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17766 states. [2018-11-06 19:56:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17766 states to 17766 states and 23353 transitions. [2018-11-06 19:56:25,626 INFO L78 Accepts]: Start accepts. Automaton has 17766 states and 23353 transitions. Word has length 254 [2018-11-06 19:56:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:25,627 INFO L480 AbstractCegarLoop]: Abstraction has 17766 states and 23353 transitions. [2018-11-06 19:56:25,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:56:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 17766 states and 23353 transitions. [2018-11-06 19:56:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-11-06 19:56:25,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:25,661 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:25,661 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:25,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1124759438, now seen corresponding path program 1 times [2018-11-06 19:56:25,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:25,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:25,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-06 19:56:25,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:25,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:25,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:25,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:25,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:25,942 INFO L87 Difference]: Start difference. First operand 17766 states and 23353 transitions. Second operand 3 states. [2018-11-06 19:56:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:27,784 INFO L93 Difference]: Finished difference Result 49401 states and 64994 transitions. [2018-11-06 19:56:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:27,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-11-06 19:56:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:27,841 INFO L225 Difference]: With dead ends: 49401 [2018-11-06 19:56:27,841 INFO L226 Difference]: Without dead ends: 31637 [2018-11-06 19:56:27,864 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:56:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31637 states. [2018-11-06 19:56:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31637 to 31635. [2018-11-06 19:56:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2018-11-06 19:56:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 39361 transitions. [2018-11-06 19:56:28,330 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 39361 transitions. Word has length 283 [2018-11-06 19:56:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:28,330 INFO L480 AbstractCegarLoop]: Abstraction has 31635 states and 39361 transitions. [2018-11-06 19:56:28,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 39361 transitions. [2018-11-06 19:56:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-06 19:56:28,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:28,387 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:56:28,387 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:28,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash 65775976, now seen corresponding path program 1 times [2018-11-06 19:56:28,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:28,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 19:56:28,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:28,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:56:28,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:28,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:28,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:28,740 INFO L87 Difference]: Start difference. First operand 31635 states and 39361 transitions. Second operand 4 states. [2018-11-06 19:56:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:31,143 INFO L93 Difference]: Finished difference Result 68576 states and 85864 transitions. [2018-11-06 19:56:31,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:31,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-11-06 19:56:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:31,200 INFO L225 Difference]: With dead ends: 68576 [2018-11-06 19:56:31,200 INFO L226 Difference]: Without dead ends: 36943 [2018-11-06 19:56:31,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36943 states. [2018-11-06 19:56:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36943 to 36123. [2018-11-06 19:56:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36123 states. [2018-11-06 19:56:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36123 states to 36123 states and 41787 transitions. [2018-11-06 19:56:32,010 INFO L78 Accepts]: Start accepts. Automaton has 36123 states and 41787 transitions. Word has length 311 [2018-11-06 19:56:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:32,011 INFO L480 AbstractCegarLoop]: Abstraction has 36123 states and 41787 transitions. [2018-11-06 19:56:32,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 36123 states and 41787 transitions. [2018-11-06 19:56:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-06 19:56:32,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:32,074 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:32,075 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:32,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash 758772804, now seen corresponding path program 1 times [2018-11-06 19:56:32,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:32,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:32,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:32,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:32,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-06 19:56:32,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:32,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:32,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:32,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:32,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:32,423 INFO L87 Difference]: Start difference. First operand 36123 states and 41787 transitions. Second operand 4 states. [2018-11-06 19:56:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:34,374 INFO L93 Difference]: Finished difference Result 118452 states and 136506 transitions. [2018-11-06 19:56:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:34,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2018-11-06 19:56:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:34,464 INFO L225 Difference]: With dead ends: 118452 [2018-11-06 19:56:34,464 INFO L226 Difference]: Without dead ends: 82331 [2018-11-06 19:56:34,503 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:56:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82331 states. [2018-11-06 19:56:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82331 to 57541. [2018-11-06 19:56:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57541 states. [2018-11-06 19:56:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57541 states to 57541 states and 65892 transitions. [2018-11-06 19:56:35,396 INFO L78 Accepts]: Start accepts. Automaton has 57541 states and 65892 transitions. Word has length 383 [2018-11-06 19:56:35,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:35,397 INFO L480 AbstractCegarLoop]: Abstraction has 57541 states and 65892 transitions. [2018-11-06 19:56:35,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 57541 states and 65892 transitions. [2018-11-06 19:56:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-11-06 19:56:35,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:35,879 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:35,880 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:35,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1978223606, now seen corresponding path program 1 times [2018-11-06 19:56:35,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 19:56:36,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:36,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:36,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:36,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:36,175 INFO L87 Difference]: Start difference. First operand 57541 states and 65892 transitions. Second operand 3 states. [2018-11-06 19:56:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:37,908 INFO L93 Difference]: Finished difference Result 113652 states and 130133 transitions. [2018-11-06 19:56:37,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:37,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2018-11-06 19:56:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:37,969 INFO L225 Difference]: With dead ends: 113652 [2018-11-06 19:56:37,969 INFO L226 Difference]: Without dead ends: 56113 [2018-11-06 19:56:38,007 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:56:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56113 states. [2018-11-06 19:56:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56113 to 55905. [2018-11-06 19:56:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55905 states. [2018-11-06 19:56:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55905 states to 55905 states and 61880 transitions. [2018-11-06 19:56:38,700 INFO L78 Accepts]: Start accepts. Automaton has 55905 states and 61880 transitions. Word has length 391 [2018-11-06 19:56:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:38,700 INFO L480 AbstractCegarLoop]: Abstraction has 55905 states and 61880 transitions. [2018-11-06 19:56:38,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 55905 states and 61880 transitions. [2018-11-06 19:56:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-06 19:56:38,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:38,748 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:38,748 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:38,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash -162814027, now seen corresponding path program 1 times [2018-11-06 19:56:38,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:38,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:38,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:39,447 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 19:56:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-06 19:56:39,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:39,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:56:39,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:56:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:56:39,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:39,643 INFO L87 Difference]: Start difference. First operand 55905 states and 61880 transitions. Second operand 5 states. [2018-11-06 19:56:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:44,614 INFO L93 Difference]: Finished difference Result 261896 states and 289431 transitions. [2018-11-06 19:56:44,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:56:44,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 404 [2018-11-06 19:56:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:44,845 INFO L225 Difference]: With dead ends: 261896 [2018-11-06 19:56:44,845 INFO L226 Difference]: Without dead ends: 205993 [2018-11-06 19:56:44,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205993 states. [2018-11-06 19:56:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205993 to 152547. [2018-11-06 19:56:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152547 states. [2018-11-06 19:56:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152547 states to 152547 states and 168161 transitions. [2018-11-06 19:56:47,802 INFO L78 Accepts]: Start accepts. Automaton has 152547 states and 168161 transitions. Word has length 404 [2018-11-06 19:56:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:47,802 INFO L480 AbstractCegarLoop]: Abstraction has 152547 states and 168161 transitions. [2018-11-06 19:56:47,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:56:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 152547 states and 168161 transitions. [2018-11-06 19:56:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-11-06 19:56:47,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:47,857 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:47,857 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:47,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash 361382077, now seen corresponding path program 1 times [2018-11-06 19:56:47,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:47,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:47,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:48,375 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 19:56:48,546 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:56:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-06 19:56:48,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:48,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:56:48,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:56:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:56:48,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:48,643 INFO L87 Difference]: Start difference. First operand 152547 states and 168161 transitions. Second operand 5 states. [2018-11-06 19:56:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:51,755 INFO L93 Difference]: Finished difference Result 346907 states and 381849 transitions. [2018-11-06 19:56:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:56:51,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 426 [2018-11-06 19:56:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:51,970 INFO L225 Difference]: With dead ends: 346907 [2018-11-06 19:56:51,970 INFO L226 Difference]: Without dead ends: 194362 [2018-11-06 19:56:52,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194362 states. [2018-11-06 19:56:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194362 to 162585. [2018-11-06 19:56:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162585 states. [2018-11-06 19:56:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162585 states to 162585 states and 180131 transitions. [2018-11-06 19:56:55,093 INFO L78 Accepts]: Start accepts. Automaton has 162585 states and 180131 transitions. Word has length 426 [2018-11-06 19:56:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:55,094 INFO L480 AbstractCegarLoop]: Abstraction has 162585 states and 180131 transitions. [2018-11-06 19:56:55,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:56:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 162585 states and 180131 transitions. [2018-11-06 19:56:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-11-06 19:56:55,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:55,147 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:55,148 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:55,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash 203787220, now seen corresponding path program 1 times [2018-11-06 19:56:55,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:55,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:55,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:55,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:55,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 19:56:55,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:55,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:55,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:55,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:55,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:55,734 INFO L87 Difference]: Start difference. First operand 162585 states and 180131 transitions. Second operand 4 states. [2018-11-06 19:56:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:58,778 INFO L93 Difference]: Finished difference Result 323326 states and 358314 transitions. [2018-11-06 19:56:58,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:58,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 429 [2018-11-06 19:56:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:58,987 INFO L225 Difference]: With dead ends: 323326 [2018-11-06 19:56:58,987 INFO L226 Difference]: Without dead ends: 160743 [2018-11-06 19:56:59,080 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:56:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160743 states. [2018-11-06 19:57:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160743 to 149263. [2018-11-06 19:57:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149263 states. [2018-11-06 19:57:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149263 states to 149263 states and 164698 transitions. [2018-11-06 19:57:02,283 INFO L78 Accepts]: Start accepts. Automaton has 149263 states and 164698 transitions. Word has length 429 [2018-11-06 19:57:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:02,284 INFO L480 AbstractCegarLoop]: Abstraction has 149263 states and 164698 transitions. [2018-11-06 19:57:02,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:57:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 149263 states and 164698 transitions. [2018-11-06 19:57:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-11-06 19:57:02,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:02,332 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:57:02,332 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:02,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash 15182724, now seen corresponding path program 1 times [2018-11-06 19:57:02,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:02,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:02,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:02,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:02,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-06 19:57:02,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:02,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:57:02,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:57:02,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:57:02,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:02,763 INFO L87 Difference]: Start difference. First operand 149263 states and 164698 transitions. Second operand 4 states. [2018-11-06 19:57:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:10,217 INFO L93 Difference]: Finished difference Result 301632 states and 333203 transitions. [2018-11-06 19:57:10,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:57:10,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2018-11-06 19:57:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:10,388 INFO L225 Difference]: With dead ends: 301632 [2018-11-06 19:57:10,389 INFO L226 Difference]: Without dead ends: 152371 [2018-11-06 19:57:10,453 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:57:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152371 states. [2018-11-06 19:57:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152371 to 150903. [2018-11-06 19:57:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150903 states. [2018-11-06 19:57:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150903 states to 150903 states and 165702 transitions. [2018-11-06 19:57:12,114 INFO L78 Accepts]: Start accepts. Automaton has 150903 states and 165702 transitions. Word has length 434 [2018-11-06 19:57:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:12,115 INFO L480 AbstractCegarLoop]: Abstraction has 150903 states and 165702 transitions. [2018-11-06 19:57:12,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:57:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 150903 states and 165702 transitions. [2018-11-06 19:57:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-11-06 19:57:12,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:12,149 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:12,149 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:12,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash 368619541, now seen corresponding path program 1 times [2018-11-06 19:57:12,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:12,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:12,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:12,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-06 19:57:13,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:13,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:57:13,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:57:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:57:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:13,147 INFO L87 Difference]: Start difference. First operand 150903 states and 165702 transitions. Second operand 4 states. [2018-11-06 19:57:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:16,940 INFO L93 Difference]: Finished difference Result 401494 states and 439112 transitions. [2018-11-06 19:57:16,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:57:16,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 445 [2018-11-06 19:57:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:17,249 INFO L225 Difference]: With dead ends: 401494 [2018-11-06 19:57:17,249 INFO L226 Difference]: Without dead ends: 250593 [2018-11-06 19:57:17,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250593 states. [2018-11-06 19:57:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250593 to 193295. [2018-11-06 19:57:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193295 states. [2018-11-06 19:57:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193295 states to 193295 states and 209833 transitions. [2018-11-06 19:57:20,361 INFO L78 Accepts]: Start accepts. Automaton has 193295 states and 209833 transitions. Word has length 445 [2018-11-06 19:57:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:20,362 INFO L480 AbstractCegarLoop]: Abstraction has 193295 states and 209833 transitions. [2018-11-06 19:57:20,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:57:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 193295 states and 209833 transitions. [2018-11-06 19:57:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-11-06 19:57:20,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:20,404 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:20,405 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:20,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash 153501173, now seen corresponding path program 1 times [2018-11-06 19:57:20,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:20,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:20,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:20,888 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:57:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 19:57:22,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:57:22,106 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:57:22,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:22,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:57:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-06 19:57:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:57:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2018-11-06 19:57:22,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 19:57:22,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 19:57:22,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:57:22,602 INFO L87 Difference]: Start difference. First operand 193295 states and 209833 transitions. Second operand 11 states. [2018-11-06 19:57:23,103 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-06 19:57:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:38,310 INFO L93 Difference]: Finished difference Result 866303 states and 935702 transitions. [2018-11-06 19:57:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-06 19:57:38,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 462 [2018-11-06 19:57:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:39,267 INFO L225 Difference]: With dead ends: 866303 [2018-11-06 19:57:39,267 INFO L226 Difference]: Without dead ends: 673010 [2018-11-06 19:57:39,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 482 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 19:57:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673010 states. [2018-11-06 19:57:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673010 to 548958. [2018-11-06 19:57:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548958 states. [2018-11-06 19:57:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548958 states to 548958 states and 592773 transitions. [2018-11-06 19:57:49,271 INFO L78 Accepts]: Start accepts. Automaton has 548958 states and 592773 transitions. Word has length 462 [2018-11-06 19:57:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:49,272 INFO L480 AbstractCegarLoop]: Abstraction has 548958 states and 592773 transitions. [2018-11-06 19:57:49,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 19:57:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 548958 states and 592773 transitions. [2018-11-06 19:57:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-06 19:57:49,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:49,363 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:49,364 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:49,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1972226690, now seen corresponding path program 1 times [2018-11-06 19:57:49,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:49,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:49,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-06 19:57:49,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:49,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:57:49,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:57:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:57:49,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:49,830 INFO L87 Difference]: Start difference. First operand 548958 states and 592773 transitions. Second operand 4 states. [2018-11-06 19:58:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:03,552 INFO L93 Difference]: Finished difference Result 1688014 states and 1813484 transitions. [2018-11-06 19:58:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:03,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 484 [2018-11-06 19:58:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:05,193 INFO L225 Difference]: With dead ends: 1688014 [2018-11-06 19:58:05,194 INFO L226 Difference]: Without dead ends: 1139058 [2018-11-06 19:58:05,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:58:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139058 states. [2018-11-06 19:58:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139058 to 807719. [2018-11-06 19:58:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807719 states. [2018-11-06 19:58:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807719 states to 807719 states and 865027 transitions. [2018-11-06 19:58:22,167 INFO L78 Accepts]: Start accepts. Automaton has 807719 states and 865027 transitions. Word has length 484 [2018-11-06 19:58:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:22,167 INFO L480 AbstractCegarLoop]: Abstraction has 807719 states and 865027 transitions. [2018-11-06 19:58:22,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 807719 states and 865027 transitions. [2018-11-06 19:58:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-11-06 19:58:22,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:22,318 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:22,318 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:22,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1740903967, now seen corresponding path program 1 times [2018-11-06 19:58:22,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:22,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:22,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:22,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:22,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-11-06 19:58:22,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:22,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:22,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:22,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:22,697 INFO L87 Difference]: Start difference. First operand 807719 states and 865027 transitions. Second operand 3 states. [2018-11-06 19:58:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:36,710 INFO L93 Difference]: Finished difference Result 1463161 states and 1570512 transitions. [2018-11-06 19:58:36,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:36,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 522 [2018-11-06 19:58:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:39,060 INFO L225 Difference]: With dead ends: 1463161 [2018-11-06 19:58:39,060 INFO L226 Difference]: Without dead ends: 655444 [2018-11-06 19:58:39,289 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:58:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655444 states. [2018-11-06 19:58:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655444 to 647893. [2018-11-06 19:58:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647893 states. [2018-11-06 19:58:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647893 states to 647893 states and 692151 transitions. [2018-11-06 19:58:49,002 INFO L78 Accepts]: Start accepts. Automaton has 647893 states and 692151 transitions. Word has length 522 [2018-11-06 19:58:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:49,002 INFO L480 AbstractCegarLoop]: Abstraction has 647893 states and 692151 transitions. [2018-11-06 19:58:49,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 647893 states and 692151 transitions. [2018-11-06 19:58:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-11-06 19:58:49,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:49,141 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:49,141 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:49,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1648087323, now seen corresponding path program 1 times [2018-11-06 19:58:49,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:49,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:49,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:49,546 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 19:58:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-06 19:58:51,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:51,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:51,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:51,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:51,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:51,169 INFO L87 Difference]: Start difference. First operand 647893 states and 692151 transitions. Second operand 4 states. [2018-11-06 19:59:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:01,185 INFO L93 Difference]: Finished difference Result 1698396 states and 1816489 transitions. [2018-11-06 19:59:01,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:01,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 531 [2018-11-06 19:59:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-11-06 19:59:14,180 INFO L225 Difference]: With dead ends: 1698396 [2018-11-06 19:59:14,180 INFO L226 Difference]: Without dead ends: 1050505 [2018-11-06 19:59:14,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050505 states. [2018-11-06 19:59:15,063 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:59:15,067 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:59:15,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:59:15 BoogieIcfgContainer [2018-11-06 19:59:15,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:59:15,068 INFO L168 Benchmark]: Toolchain (without parser) took 203492.00 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.1 GB). Free memory was 1.4 GB in the beginning and 4.4 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,069 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:59:15,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1225.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 319.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -858.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,071 INFO L168 Benchmark]: Boogie Preprocessor took 186.44 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:59:15,072 INFO L168 Benchmark]: RCFGBuilder took 5666.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 274.0 MB). Peak memory consumption was 274.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,072 INFO L168 Benchmark]: TraceAbstraction took 196087.87 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 4.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,077 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1225.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 319.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -858.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 186.44 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 5666.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 274.0 MB). Peak memory consumption was 274.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196087.87 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 4.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1644]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1644). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 196.0s OverallTime, 21 OverallIterations, 8 TraceHistogramMax, 127.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5726 SDtfs, 17236 SDslu, 4886 SDs, 0 SdLazy, 27108 SolverSat, 4570 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 762 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=807719occurred 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: 54.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 646228 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 8047 NumberOfCodeBlocks, 8047 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 8024 ConstructedInterpolants, 0 QuantifiedInterpolants, 8056753 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 5960/6019 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown