java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/mem_slave_tlm.5.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:32:06,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:32:06,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:32:06,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:32:06,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:32:06,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:32:06,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:32:06,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:32:06,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:32:06,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:32:06,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:32:06,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:32:06,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:32:06,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:32:06,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:32:06,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:32:06,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:32:06,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:32:06,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:32:06,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:32:06,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:32:06,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:32:06,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:32:06,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:32:06,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:32:06,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:32:06,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:32:06,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:32:06,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:32:06,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:32:06,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:32:06,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:32:06,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:32:06,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:32:06,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:32:06,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:32:06,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:32:06,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:32:06,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:32:06,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:32:06,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:32:06,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:32:06,655 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:32:06,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:32:06,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:32:06,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:32:06,657 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:32:06,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:32:06,658 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:32:06,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:32:06,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:32:06,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:32:06,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:32:06,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:32:06,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:32:06,659 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:32:06,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:32:06,659 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:32:06,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:32:06,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:32:06,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:32:06,660 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:32:06,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:32:06,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:32:06,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:32:06,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:32:06,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:32:06,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:32:06,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:32:06,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:32:06,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:32:06,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:32:06,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:32:06,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:32:06,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:32:06,707 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:32:06,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.5.cil.c [2019-09-08 06:32:06,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4eb35358/a1f144e17d6c4c789724621f739efea7/FLAG00614b6cb [2019-09-08 06:32:07,226 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:32:07,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.5.cil.c [2019-09-08 06:32:07,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4eb35358/a1f144e17d6c4c789724621f739efea7/FLAG00614b6cb [2019-09-08 06:32:07,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4eb35358/a1f144e17d6c4c789724621f739efea7 [2019-09-08 06:32:07,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:32:07,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:32:07,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:32:07,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:32:07,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:32:07,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:32:07" (1/1) ... [2019-09-08 06:32:07,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d76297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:07, skipping insertion in model container [2019-09-08 06:32:07,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:32:07" (1/1) ... [2019-09-08 06:32:07,571 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:32:07,635 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:32:08,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:32:08,067 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:32:08,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:32:08,186 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:32:08,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08 WrapperNode [2019-09-08 06:32:08,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:32:08,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:32:08,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:32:08,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:32:08,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (1/1) ... [2019-09-08 06:32:08,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (1/1) ... [2019-09-08 06:32:08,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (1/1) ... [2019-09-08 06:32:08,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (1/1) ... [2019-09-08 06:32:08,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (1/1) ... [2019-09-08 06:32:08,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (1/1) ... [2019-09-08 06:32:08,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (1/1) ... [2019-09-08 06:32:08,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:32:08,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:32:08,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:32:08,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:32:08,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (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 [2019-09-08 06:32:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:32:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:32:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:32:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_read [2019-09-08 06:32:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_write [2019-09-08 06:32:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure m_run [2019-09-08 06:32:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure s_run [2019-09-08 06:32:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:32:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:32:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:32:08,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:32:08,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:32:08,354 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:32:08,354 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_read [2019-09-08 06:32:08,355 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_write [2019-09-08 06:32:08,355 INFO L130 BoogieDeclarations]: Found specification of procedure m_run [2019-09-08 06:32:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure s_run [2019-09-08 06:32:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:32:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:32:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:32:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:32:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:32:09,492 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:32:09,492 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-09-08 06:32:09,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:32:09 BoogieIcfgContainer [2019-09-08 06:32:09,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:32:09,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:32:09,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:32:09,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:32:09,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:32:07" (1/3) ... [2019-09-08 06:32:09,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af1c25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:32:09, skipping insertion in model container [2019-09-08 06:32:09,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:08" (2/3) ... [2019-09-08 06:32:09,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af1c25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:32:09, skipping insertion in model container [2019-09-08 06:32:09,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:32:09" (3/3) ... [2019-09-08 06:32:09,505 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.5.cil.c [2019-09-08 06:32:09,513 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:32:09,544 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:32:09,563 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:32:09,605 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:32:09,605 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:32:09,606 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:32:09,606 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:32:09,606 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:32:09,606 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:32:09,606 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:32:09,606 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:32:09,606 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:32:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states. [2019-09-08 06:32:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 06:32:09,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:09,647 INFO L399 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] [2019-09-08 06:32:09,651 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:09,656 INFO L82 PathProgramCache]: Analyzing trace with hash 990200895, now seen corresponding path program 1 times [2019-09-08 06:32:09,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:09,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:09,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:09,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:09,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:09,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:09,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:09,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:10,011 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 3 states. [2019-09-08 06:32:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:10,130 INFO L93 Difference]: Finished difference Result 601 states and 1074 transitions. [2019-09-08 06:32:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:10,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-08 06:32:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:10,148 INFO L225 Difference]: With dead ends: 601 [2019-09-08 06:32:10,148 INFO L226 Difference]: Without dead ends: 297 [2019-09-08 06:32:10,154 INFO L628 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 [2019-09-08 06:32:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-08 06:32:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-09-08 06:32:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-08 06:32:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 499 transitions. [2019-09-08 06:32:10,272 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 499 transitions. Word has length 39 [2019-09-08 06:32:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:10,273 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 499 transitions. [2019-09-08 06:32:10,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 499 transitions. [2019-09-08 06:32:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 06:32:10,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:10,287 INFO L399 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] [2019-09-08 06:32:10,288 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1435970439, now seen corresponding path program 1 times [2019-09-08 06:32:10,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:10,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:10,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:10,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:10,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:10,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:10,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:10,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:10,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:10,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:10,467 INFO L87 Difference]: Start difference. First operand 297 states and 499 transitions. Second operand 3 states. [2019-09-08 06:32:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:10,885 INFO L93 Difference]: Finished difference Result 787 states and 1325 transitions. [2019-09-08 06:32:10,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:10,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-08 06:32:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:10,895 INFO L225 Difference]: With dead ends: 787 [2019-09-08 06:32:10,896 INFO L226 Difference]: Without dead ends: 501 [2019-09-08 06:32:10,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-08 06:32:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 488. [2019-09-08 06:32:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 06:32:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2019-09-08 06:32:10,964 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 40 [2019-09-08 06:32:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:10,965 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2019-09-08 06:32:10,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2019-09-08 06:32:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 06:32:10,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:10,968 INFO L399 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] [2019-09-08 06:32:10,969 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1335488947, now seen corresponding path program 1 times [2019-09-08 06:32:10,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:10,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:10,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:11,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:11,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:11,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:11,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:11,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:11,086 INFO L87 Difference]: Start difference. First operand 488 states and 810 transitions. Second operand 3 states. [2019-09-08 06:32:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:11,454 INFO L93 Difference]: Finished difference Result 1169 states and 1951 transitions. [2019-09-08 06:32:11,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:11,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-08 06:32:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:11,465 INFO L225 Difference]: With dead ends: 1169 [2019-09-08 06:32:11,466 INFO L226 Difference]: Without dead ends: 693 [2019-09-08 06:32:11,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-08 06:32:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 680. [2019-09-08 06:32:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-08 06:32:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1108 transitions. [2019-09-08 06:32:11,522 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1108 transitions. Word has length 42 [2019-09-08 06:32:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:11,522 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 1108 transitions. [2019-09-08 06:32:11,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1108 transitions. [2019-09-08 06:32:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 06:32:11,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:11,527 INFO L399 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] [2019-09-08 06:32:11,527 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:11,528 INFO L82 PathProgramCache]: Analyzing trace with hash -501523311, now seen corresponding path program 1 times [2019-09-08 06:32:11,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:11,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:11,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:11,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:11,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:11,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:11,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:11,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:11,622 INFO L87 Difference]: Start difference. First operand 680 states and 1108 transitions. Second operand 3 states. [2019-09-08 06:32:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:11,930 INFO L93 Difference]: Finished difference Result 1553 states and 2555 transitions. [2019-09-08 06:32:11,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:11,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-08 06:32:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:11,939 INFO L225 Difference]: With dead ends: 1553 [2019-09-08 06:32:11,939 INFO L226 Difference]: Without dead ends: 886 [2019-09-08 06:32:11,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-09-08 06:32:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 873. [2019-09-08 06:32:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-08 06:32:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1393 transitions. [2019-09-08 06:32:12,022 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1393 transitions. Word has length 44 [2019-09-08 06:32:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:12,022 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1393 transitions. [2019-09-08 06:32:12,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1393 transitions. [2019-09-08 06:32:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 06:32:12,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:12,025 INFO L399 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] [2019-09-08 06:32:12,026 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1152278265, now seen corresponding path program 1 times [2019-09-08 06:32:12,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:12,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:12,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:12,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:12,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:12,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:12,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:12,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:12,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:12,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:12,096 INFO L87 Difference]: Start difference. First operand 873 states and 1393 transitions. Second operand 3 states. [2019-09-08 06:32:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:12,364 INFO L93 Difference]: Finished difference Result 1884 states and 3053 transitions. [2019-09-08 06:32:12,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:12,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-08 06:32:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:12,372 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 06:32:12,372 INFO L226 Difference]: Without dead ends: 1025 [2019-09-08 06:32:12,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-09-08 06:32:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1016. [2019-09-08 06:32:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-09-08 06:32:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1585 transitions. [2019-09-08 06:32:12,430 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1585 transitions. Word has length 49 [2019-09-08 06:32:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:12,431 INFO L475 AbstractCegarLoop]: Abstraction has 1016 states and 1585 transitions. [2019-09-08 06:32:12,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1585 transitions. [2019-09-08 06:32:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 06:32:12,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:12,433 INFO L399 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] [2019-09-08 06:32:12,433 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:12,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 961720930, now seen corresponding path program 1 times [2019-09-08 06:32:12,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:12,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:12,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:12,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:12,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:12,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:12,488 INFO L87 Difference]: Start difference. First operand 1016 states and 1585 transitions. Second operand 3 states. [2019-09-08 06:32:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:12,717 INFO L93 Difference]: Finished difference Result 2912 states and 4730 transitions. [2019-09-08 06:32:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:12,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 06:32:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:12,730 INFO L225 Difference]: With dead ends: 2912 [2019-09-08 06:32:12,731 INFO L226 Difference]: Without dead ends: 1915 [2019-09-08 06:32:12,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2019-09-08 06:32:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1898. [2019-09-08 06:32:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-09-08 06:32:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2988 transitions. [2019-09-08 06:32:12,861 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2988 transitions. Word has length 51 [2019-09-08 06:32:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:12,861 INFO L475 AbstractCegarLoop]: Abstraction has 1898 states and 2988 transitions. [2019-09-08 06:32:12,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2988 transitions. [2019-09-08 06:32:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 06:32:12,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:12,864 INFO L399 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] [2019-09-08 06:32:12,864 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1916073214, now seen corresponding path program 1 times [2019-09-08 06:32:12,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:12,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:12,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:12,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:12,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:12,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:12,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:12,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:12,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:12,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:12,917 INFO L87 Difference]: Start difference. First operand 1898 states and 2988 transitions. Second operand 3 states. [2019-09-08 06:32:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:13,282 INFO L93 Difference]: Finished difference Result 4066 states and 6666 transitions. [2019-09-08 06:32:13,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:13,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 06:32:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:13,299 INFO L225 Difference]: With dead ends: 4066 [2019-09-08 06:32:13,299 INFO L226 Difference]: Without dead ends: 2185 [2019-09-08 06:32:13,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:13,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2019-09-08 06:32:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2173. [2019-09-08 06:32:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2173 states. [2019-09-08 06:32:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3367 transitions. [2019-09-08 06:32:13,547 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3367 transitions. Word has length 51 [2019-09-08 06:32:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:13,549 INFO L475 AbstractCegarLoop]: Abstraction has 2173 states and 3367 transitions. [2019-09-08 06:32:13,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3367 transitions. [2019-09-08 06:32:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 06:32:13,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:13,552 INFO L399 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] [2019-09-08 06:32:13,552 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1831658448, now seen corresponding path program 1 times [2019-09-08 06:32:13,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:13,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:13,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:13,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:13,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:13,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:13,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:13,614 INFO L87 Difference]: Start difference. First operand 2173 states and 3367 transitions. Second operand 3 states. [2019-09-08 06:32:13,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:13,922 INFO L93 Difference]: Finished difference Result 6229 states and 9986 transitions. [2019-09-08 06:32:13,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:13,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-08 06:32:13,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:13,948 INFO L225 Difference]: With dead ends: 6229 [2019-09-08 06:32:13,949 INFO L226 Difference]: Without dead ends: 4076 [2019-09-08 06:32:13,966 INFO L628 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 [2019-09-08 06:32:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2019-09-08 06:32:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 4057. [2019-09-08 06:32:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4057 states. [2019-09-08 06:32:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 4057 states and 6302 transitions. [2019-09-08 06:32:14,277 INFO L78 Accepts]: Start accepts. Automaton has 4057 states and 6302 transitions. Word has length 53 [2019-09-08 06:32:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:14,278 INFO L475 AbstractCegarLoop]: Abstraction has 4057 states and 6302 transitions. [2019-09-08 06:32:14,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4057 states and 6302 transitions. [2019-09-08 06:32:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 06:32:14,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:14,281 INFO L399 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] [2019-09-08 06:32:14,281 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:14,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:14,282 INFO L82 PathProgramCache]: Analyzing trace with hash 282418645, now seen corresponding path program 1 times [2019-09-08 06:32:14,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:14,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:14,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:14,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:14,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:14,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:14,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:14,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:14,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:14,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:14,371 INFO L87 Difference]: Start difference. First operand 4057 states and 6302 transitions. Second operand 3 states. [2019-09-08 06:32:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:14,701 INFO L93 Difference]: Finished difference Result 9667 states and 16774 transitions. [2019-09-08 06:32:14,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:14,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 06:32:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:14,751 INFO L225 Difference]: With dead ends: 9667 [2019-09-08 06:32:14,752 INFO L226 Difference]: Without dead ends: 5630 [2019-09-08 06:32:14,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2019-09-08 06:32:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 5539. [2019-09-08 06:32:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2019-09-08 06:32:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 9478 transitions. [2019-09-08 06:32:15,371 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 9478 transitions. Word has length 54 [2019-09-08 06:32:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:15,372 INFO L475 AbstractCegarLoop]: Abstraction has 5539 states and 9478 transitions. [2019-09-08 06:32:15,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 9478 transitions. [2019-09-08 06:32:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 06:32:15,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:15,378 INFO L399 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] [2019-09-08 06:32:15,378 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:15,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:15,378 INFO L82 PathProgramCache]: Analyzing trace with hash 10763103, now seen corresponding path program 1 times [2019-09-08 06:32:15,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:15,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:15,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:15,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:15,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:15,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:15,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:15,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:15,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:15,450 INFO L87 Difference]: Start difference. First operand 5539 states and 9478 transitions. Second operand 3 states. [2019-09-08 06:32:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:16,061 INFO L93 Difference]: Finished difference Result 11662 states and 22027 transitions. [2019-09-08 06:32:16,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:16,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 06:32:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:16,128 INFO L225 Difference]: With dead ends: 11662 [2019-09-08 06:32:16,129 INFO L226 Difference]: Without dead ends: 6138 [2019-09-08 06:32:16,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-09-08 06:32:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 6126. [2019-09-08 06:32:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6126 states. [2019-09-08 06:32:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6126 states to 6126 states and 10543 transitions. [2019-09-08 06:32:16,659 INFO L78 Accepts]: Start accepts. Automaton has 6126 states and 10543 transitions. Word has length 62 [2019-09-08 06:32:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:16,659 INFO L475 AbstractCegarLoop]: Abstraction has 6126 states and 10543 transitions. [2019-09-08 06:32:16,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 6126 states and 10543 transitions. [2019-09-08 06:32:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 06:32:16,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:16,663 INFO L399 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] [2019-09-08 06:32:16,663 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:16,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2034374652, now seen corresponding path program 1 times [2019-09-08 06:32:16,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:16,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:16,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:16,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:16,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:16,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:16,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:32:16,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:32:16,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:32:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:32:16,736 INFO L87 Difference]: Start difference. First operand 6126 states and 10543 transitions. Second operand 4 states. [2019-09-08 06:32:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:17,945 INFO L93 Difference]: Finished difference Result 10179 states and 21561 transitions. [2019-09-08 06:32:17,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:32:17,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-08 06:32:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:18,031 INFO L225 Difference]: With dead ends: 10179 [2019-09-08 06:32:18,031 INFO L226 Difference]: Without dead ends: 10175 [2019-09-08 06:32:18,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:32:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10175 states. [2019-09-08 06:32:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10175 to 10084. [2019-09-08 06:32:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10084 states. [2019-09-08 06:32:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10084 states to 10084 states and 21398 transitions. [2019-09-08 06:32:19,706 INFO L78 Accepts]: Start accepts. Automaton has 10084 states and 21398 transitions. Word has length 63 [2019-09-08 06:32:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:19,707 INFO L475 AbstractCegarLoop]: Abstraction has 10084 states and 21398 transitions. [2019-09-08 06:32:19,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:32:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 10084 states and 21398 transitions. [2019-09-08 06:32:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 06:32:19,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:19,718 INFO L399 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] [2019-09-08 06:32:19,719 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:19,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:19,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2061687861, now seen corresponding path program 1 times [2019-09-08 06:32:19,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:19,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:19,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:19,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:19,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:19,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:19,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:19,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:19,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:19,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:19,796 INFO L87 Difference]: Start difference. First operand 10084 states and 21398 transitions. Second operand 3 states. [2019-09-08 06:32:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:20,387 INFO L93 Difference]: Finished difference Result 19591 states and 48457 transitions. [2019-09-08 06:32:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:20,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 06:32:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:20,450 INFO L225 Difference]: With dead ends: 19591 [2019-09-08 06:32:20,450 INFO L226 Difference]: Without dead ends: 9526 [2019-09-08 06:32:20,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9526 states. [2019-09-08 06:32:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9526 to 9486. [2019-09-08 06:32:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9486 states. [2019-09-08 06:32:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9486 states to 9486 states and 20433 transitions. [2019-09-08 06:32:21,755 INFO L78 Accepts]: Start accepts. Automaton has 9486 states and 20433 transitions. Word has length 79 [2019-09-08 06:32:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:21,756 INFO L475 AbstractCegarLoop]: Abstraction has 9486 states and 20433 transitions. [2019-09-08 06:32:21,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 9486 states and 20433 transitions. [2019-09-08 06:32:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:32:21,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:21,766 INFO L399 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] [2019-09-08 06:32:21,766 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:21,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash 132963127, now seen corresponding path program 1 times [2019-09-08 06:32:21,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:21,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:21,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:21,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:21,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:21,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:21,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:32:21,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:32:21,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:32:21,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:32:21,845 INFO L87 Difference]: Start difference. First operand 9486 states and 20433 transitions. Second operand 4 states. [2019-09-08 06:32:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:23,611 INFO L93 Difference]: Finished difference Result 20670 states and 51497 transitions. [2019-09-08 06:32:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:32:23,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-08 06:32:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:23,682 INFO L225 Difference]: With dead ends: 20670 [2019-09-08 06:32:23,682 INFO L226 Difference]: Without dead ends: 11203 [2019-09-08 06:32:23,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:32:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11203 states. [2019-09-08 06:32:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11203 to 10152. [2019-09-08 06:32:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10152 states. [2019-09-08 06:32:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10152 states to 10152 states and 21906 transitions. [2019-09-08 06:32:25,160 INFO L78 Accepts]: Start accepts. Automaton has 10152 states and 21906 transitions. Word has length 77 [2019-09-08 06:32:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:25,160 INFO L475 AbstractCegarLoop]: Abstraction has 10152 states and 21906 transitions. [2019-09-08 06:32:25,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:32:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 10152 states and 21906 transitions. [2019-09-08 06:32:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 06:32:25,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:25,165 INFO L399 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] [2019-09-08 06:32:25,166 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:25,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:25,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2068597558, now seen corresponding path program 1 times [2019-09-08 06:32:25,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:25,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:25,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:25,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:25,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:32:25,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:32:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:32:25,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:32:25,224 INFO L87 Difference]: Start difference. First operand 10152 states and 21906 transitions. Second operand 3 states. [2019-09-08 06:32:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:26,277 INFO L93 Difference]: Finished difference Result 20231 states and 50756 transitions. [2019-09-08 06:32:26,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:32:26,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 06:32:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:26,329 INFO L225 Difference]: With dead ends: 20231 [2019-09-08 06:32:26,329 INFO L226 Difference]: Without dead ends: 10098 [2019-09-08 06:32:26,497 INFO L628 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 [2019-09-08 06:32:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-08 06:32:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10076. [2019-09-08 06:32:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10076 states. [2019-09-08 06:32:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10076 states to 10076 states and 21675 transitions. [2019-09-08 06:32:28,758 INFO L78 Accepts]: Start accepts. Automaton has 10076 states and 21675 transitions. Word has length 81 [2019-09-08 06:32:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:28,759 INFO L475 AbstractCegarLoop]: Abstraction has 10076 states and 21675 transitions. [2019-09-08 06:32:28,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:32:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 10076 states and 21675 transitions. [2019-09-08 06:32:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 06:32:28,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:28,766 INFO L399 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] [2019-09-08 06:32:28,767 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:28,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1385447662, now seen corresponding path program 1 times [2019-09-08 06:32:28,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:28,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:28,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:28,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:28,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:28,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:28,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 06:32:28,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:32:28,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:32:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:32:28,965 INFO L87 Difference]: Start difference. First operand 10076 states and 21675 transitions. Second operand 9 states. [2019-09-08 06:32:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:33,826 INFO L93 Difference]: Finished difference Result 30701 states and 152153 transitions. [2019-09-08 06:32:33,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 06:32:33,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 06:32:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:34,109 INFO L225 Difference]: With dead ends: 30701 [2019-09-08 06:32:34,109 INFO L226 Difference]: Without dead ends: 20644 [2019-09-08 06:32:34,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2019-09-08 06:32:34,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20644 states. [2019-09-08 06:32:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20644 to 19654. [2019-09-08 06:32:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19654 states. [2019-09-08 06:32:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19654 states to 19654 states and 89578 transitions. [2019-09-08 06:32:42,354 INFO L78 Accepts]: Start accepts. Automaton has 19654 states and 89578 transitions. Word has length 82 [2019-09-08 06:32:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:42,355 INFO L475 AbstractCegarLoop]: Abstraction has 19654 states and 89578 transitions. [2019-09-08 06:32:42,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:32:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 19654 states and 89578 transitions. [2019-09-08 06:32:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 06:32:42,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:42,364 INFO L399 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] [2019-09-08 06:32:42,364 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 546962601, now seen corresponding path program 1 times [2019-09-08 06:32:42,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:32:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:32:42,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:32:42,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:32:42,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:32:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:32:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:32:42,461 INFO L87 Difference]: Start difference. First operand 19654 states and 89578 transitions. Second operand 8 states. [2019-09-08 06:32:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:50,791 INFO L93 Difference]: Finished difference Result 50841 states and 364819 transitions. [2019-09-08 06:32:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:32:50,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-08 06:32:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:51,193 INFO L225 Difference]: With dead ends: 50841 [2019-09-08 06:32:51,193 INFO L226 Difference]: Without dead ends: 31278 [2019-09-08 06:32:52,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:32:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31278 states. [2019-09-08 06:33:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31278 to 29406. [2019-09-08 06:33:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29406 states. [2019-09-08 06:33:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29406 states to 29406 states and 187320 transitions. [2019-09-08 06:33:15,477 INFO L78 Accepts]: Start accepts. Automaton has 29406 states and 187320 transitions. Word has length 83 [2019-09-08 06:33:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:15,478 INFO L475 AbstractCegarLoop]: Abstraction has 29406 states and 187320 transitions. [2019-09-08 06:33:15,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:33:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 29406 states and 187320 transitions. [2019-09-08 06:33:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 06:33:15,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:15,491 INFO L399 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] [2019-09-08 06:33:15,491 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:15,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 169998781, now seen corresponding path program 1 times [2019-09-08 06:33:15,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:15,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:15,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:15,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:33:15,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:33:15,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:33:15,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:33:15,575 INFO L87 Difference]: Start difference. First operand 29406 states and 187320 transitions. Second operand 8 states. [2019-09-08 06:33:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:33,766 INFO L93 Difference]: Finished difference Result 80259 states and 904986 transitions. [2019-09-08 06:33:33,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:33:33,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-09-08 06:33:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:35,908 INFO L225 Difference]: With dead ends: 80259 [2019-09-08 06:33:35,908 INFO L226 Difference]: Without dead ends: 50871 [2019-09-08 06:33:39,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:33:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50871 states. [2019-09-08 06:35:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50871 to 44862. [2019-09-08 06:35:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44862 states. [2019-09-08 06:35:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44862 states to 44862 states and 363233 transitions. [2019-09-08 06:35:13,516 INFO L78 Accepts]: Start accepts. Automaton has 44862 states and 363233 transitions. Word has length 88 [2019-09-08 06:35:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:13,516 INFO L475 AbstractCegarLoop]: Abstraction has 44862 states and 363233 transitions. [2019-09-08 06:35:13,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:35:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 44862 states and 363233 transitions. [2019-09-08 06:35:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 06:35:13,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:13,528 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:13,528 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:13,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 672928587, now seen corresponding path program 1 times [2019-09-08 06:35:13,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:13,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:35:13,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:13,595 INFO L223 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) [2019-09-08 06:35:13,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:13,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:35:13,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:35:13,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:35:13,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:35:13,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:35:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:35:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:35:13,860 INFO L87 Difference]: Start difference. First operand 44862 states and 363233 transitions. Second operand 6 states. [2019-09-08 06:35:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:33,992 INFO L93 Difference]: Finished difference Result 88695 states and 799617 transitions. [2019-09-08 06:35:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:35:33,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-08 06:35:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:34,867 INFO L225 Difference]: With dead ends: 88695 [2019-09-08 06:35:34,867 INFO L226 Difference]: Without dead ends: 40568 [2019-09-08 06:35:41,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:35:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40568 states. [2019-09-08 06:36:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40568 to 33364. [2019-09-08 06:36:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33364 states. [2019-09-08 06:36:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33364 states to 33364 states and 149789 transitions. [2019-09-08 06:36:15,238 INFO L78 Accepts]: Start accepts. Automaton has 33364 states and 149789 transitions. Word has length 93 [2019-09-08 06:36:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:15,239 INFO L475 AbstractCegarLoop]: Abstraction has 33364 states and 149789 transitions. [2019-09-08 06:36:15,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:36:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 33364 states and 149789 transitions. [2019-09-08 06:36:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 06:36:15,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:15,251 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:36:15,252 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash -257368844, now seen corresponding path program 1 times [2019-09-08 06:36:15,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:15,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:15,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:36:15,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:36:15,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:36:15,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:36:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:36:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:36:15,322 INFO L87 Difference]: Start difference. First operand 33364 states and 149789 transitions. Second operand 3 states. [2019-09-08 06:36:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:24,298 INFO L93 Difference]: Finished difference Result 57985 states and 319305 transitions. [2019-09-08 06:36:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:36:24,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 06:36:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:24,765 INFO L225 Difference]: With dead ends: 57985 [2019-09-08 06:36:24,765 INFO L226 Difference]: Without dead ends: 24672 [2019-09-08 06:36:26,453 INFO L628 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 [2019-09-08 06:36:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2019-09-08 06:36:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 21713. [2019-09-08 06:36:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21713 states. [2019-09-08 06:36:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21713 states to 21713 states and 61108 transitions. [2019-09-08 06:36:35,882 INFO L78 Accepts]: Start accepts. Automaton has 21713 states and 61108 transitions. Word has length 118 [2019-09-08 06:36:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:35,882 INFO L475 AbstractCegarLoop]: Abstraction has 21713 states and 61108 transitions. [2019-09-08 06:36:35,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:36:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 21713 states and 61108 transitions. [2019-09-08 06:36:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 06:36:35,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:35,897 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:35,897 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1849465500, now seen corresponding path program 1 times [2019-09-08 06:36:35,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:35,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:35,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:35,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 06:36:36,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:36:36,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:36:36,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:36:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:36:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:36:36,004 INFO L87 Difference]: Start difference. First operand 21713 states and 61108 transitions. Second operand 4 states. [2019-09-08 06:36:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:37,860 INFO L93 Difference]: Finished difference Result 39773 states and 127520 transitions. [2019-09-08 06:36:37,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:36:37,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-09-08 06:36:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:38,106 INFO L225 Difference]: With dead ends: 39773 [2019-09-08 06:36:38,106 INFO L226 Difference]: Without dead ends: 16288 [2019-09-08 06:36:38,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:36:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16288 states. [2019-09-08 06:36:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16288 to 15063. [2019-09-08 06:36:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15063 states. [2019-09-08 06:36:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15063 states to 15063 states and 38232 transitions. [2019-09-08 06:36:40,893 INFO L78 Accepts]: Start accepts. Automaton has 15063 states and 38232 transitions. Word has length 193 [2019-09-08 06:36:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:40,893 INFO L475 AbstractCegarLoop]: Abstraction has 15063 states and 38232 transitions. [2019-09-08 06:36:40,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:36:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 15063 states and 38232 transitions. [2019-09-08 06:36:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 06:36:40,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:40,902 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:40,902 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash -129017175, now seen corresponding path program 1 times [2019-09-08 06:36:40,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:40,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:40,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:40,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 06:36:41,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:36:41,012 INFO L223 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 [2019-09-08 06:36:41,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:41,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:36:41,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:36:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 06:36:41,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:36:41,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:36:41,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:36:41,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:36:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:36:41,348 INFO L87 Difference]: Start difference. First operand 15063 states and 38232 transitions. Second operand 7 states. [2019-09-08 06:36:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:43,692 INFO L93 Difference]: Finished difference Result 34453 states and 113480 transitions. [2019-09-08 06:36:43,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:36:43,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-09-08 06:36:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:43,919 INFO L225 Difference]: With dead ends: 34453 [2019-09-08 06:36:43,920 INFO L226 Difference]: Without dead ends: 19441 [2019-09-08 06:36:44,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:36:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19441 states. [2019-09-08 06:36:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19441 to 14832. [2019-09-08 06:36:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14832 states. [2019-09-08 06:36:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 37082 transitions. [2019-09-08 06:36:46,656 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 37082 transitions. Word has length 160 [2019-09-08 06:36:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:46,657 INFO L475 AbstractCegarLoop]: Abstraction has 14832 states and 37082 transitions. [2019-09-08 06:36:46,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:36:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 37082 transitions. [2019-09-08 06:36:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 06:36:46,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:46,666 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:46,666 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:46,666 INFO L82 PathProgramCache]: Analyzing trace with hash -566261020, now seen corresponding path program 1 times [2019-09-08 06:36:46,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:46,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:46,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:46,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:46,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:36:47,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:36:47,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 06:36:47,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:36:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:36:47,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:36:47,299 INFO L87 Difference]: Start difference. First operand 14832 states and 37082 transitions. Second operand 9 states. [2019-09-08 06:36:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:50,831 INFO L93 Difference]: Finished difference Result 24995 states and 87990 transitions. [2019-09-08 06:36:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:36:50,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-09-08 06:36:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:50,979 INFO L225 Difference]: With dead ends: 24995 [2019-09-08 06:36:50,980 INFO L226 Difference]: Without dead ends: 10214 [2019-09-08 06:36:51,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:36:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10214 states. [2019-09-08 06:36:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10214 to 8649. [2019-09-08 06:36:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8649 states. [2019-09-08 06:36:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8649 states to 8649 states and 19203 transitions. [2019-09-08 06:36:52,002 INFO L78 Accepts]: Start accepts. Automaton has 8649 states and 19203 transitions. Word has length 170 [2019-09-08 06:36:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:52,002 INFO L475 AbstractCegarLoop]: Abstraction has 8649 states and 19203 transitions. [2019-09-08 06:36:52,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:36:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 8649 states and 19203 transitions. [2019-09-08 06:36:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:36:52,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:52,007 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:52,007 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:52,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:52,008 INFO L82 PathProgramCache]: Analyzing trace with hash -131035994, now seen corresponding path program 1 times [2019-09-08 06:36:52,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:52,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:52,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:52,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:36:52,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:36:52,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:36:52,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:52,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:36:52,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:36:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:36:52,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:36:52,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-09-08 06:36:52,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:36:52,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:36:52,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:36:52,988 INFO L87 Difference]: Start difference. First operand 8649 states and 19203 transitions. Second operand 6 states. [2019-09-08 06:36:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:36:54,982 INFO L93 Difference]: Finished difference Result 18462 states and 45901 transitions. [2019-09-08 06:36:54,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:36:54,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 06:36:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:36:55,220 INFO L225 Difference]: With dead ends: 18462 [2019-09-08 06:36:55,221 INFO L226 Difference]: Without dead ends: 9864 [2019-09-08 06:36:55,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:36:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9864 states. [2019-09-08 06:36:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9864 to 9409. [2019-09-08 06:36:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9409 states. [2019-09-08 06:36:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 20006 transitions. [2019-09-08 06:36:57,851 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 20006 transitions. Word has length 180 [2019-09-08 06:36:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:36:57,851 INFO L475 AbstractCegarLoop]: Abstraction has 9409 states and 20006 transitions. [2019-09-08 06:36:57,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:36:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 20006 transitions. [2019-09-08 06:36:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 06:36:57,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:36:57,855 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:36:57,856 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:36:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:36:57,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1861815236, now seen corresponding path program 1 times [2019-09-08 06:36:57,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:36:57,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:36:57,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:57,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:57,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:36:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 06:36:57,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:36:57,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:36:57,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:36:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:36:58,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1620 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 06:36:58,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:36:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 06:36:58,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:36:58,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-08 06:36:58,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:36:58,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:36:58,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:36:58,294 INFO L87 Difference]: Start difference. First operand 9409 states and 20006 transitions. Second operand 12 states. [2019-09-08 06:37:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:02,964 INFO L93 Difference]: Finished difference Result 22314 states and 69726 transitions. [2019-09-08 06:37:02,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 06:37:02,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 181 [2019-09-08 06:37:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:03,204 INFO L225 Difference]: With dead ends: 22314 [2019-09-08 06:37:03,204 INFO L226 Difference]: Without dead ends: 12956 [2019-09-08 06:37:04,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1525, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 06:37:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12956 states. [2019-09-08 06:37:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12956 to 10723. [2019-09-08 06:37:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10723 states. [2019-09-08 06:37:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10723 states to 10723 states and 21261 transitions. [2019-09-08 06:37:04,702 INFO L78 Accepts]: Start accepts. Automaton has 10723 states and 21261 transitions. Word has length 181 [2019-09-08 06:37:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:04,703 INFO L475 AbstractCegarLoop]: Abstraction has 10723 states and 21261 transitions. [2019-09-08 06:37:04,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:37:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 10723 states and 21261 transitions. [2019-09-08 06:37:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 06:37:04,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:37:04,706 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:37:04,707 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:37:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:37:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash -640499282, now seen corresponding path program 1 times [2019-09-08 06:37:04,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:37:04,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:37:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:04,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:37:04,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:37:04,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:37:04,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:37:04,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:37:04,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:37:04,790 INFO L87 Difference]: Start difference. First operand 10723 states and 21261 transitions. Second operand 3 states. [2019-09-08 06:37:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:05,930 INFO L93 Difference]: Finished difference Result 14936 states and 30151 transitions. [2019-09-08 06:37:05,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:37:05,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 06:37:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:05,996 INFO L225 Difference]: With dead ends: 14936 [2019-09-08 06:37:05,997 INFO L226 Difference]: Without dead ends: 9816 [2019-09-08 06:37:06,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:37:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2019-09-08 06:37:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 9658. [2019-09-08 06:37:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9658 states. [2019-09-08 06:37:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9658 states to 9658 states and 17984 transitions. [2019-09-08 06:37:06,581 INFO L78 Accepts]: Start accepts. Automaton has 9658 states and 17984 transitions. Word has length 181 [2019-09-08 06:37:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:06,581 INFO L475 AbstractCegarLoop]: Abstraction has 9658 states and 17984 transitions. [2019-09-08 06:37:06,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:37:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 9658 states and 17984 transitions. [2019-09-08 06:37:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 06:37:06,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:37:06,585 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:37:06,585 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:37:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:37:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1328774328, now seen corresponding path program 1 times [2019-09-08 06:37:06,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:37:06,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:37:06,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:06,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:06,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 06:37:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:37:06,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:37:06,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:37:06,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:37:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:37:06,663 INFO L87 Difference]: Start difference. First operand 9658 states and 17984 transitions. Second operand 3 states. [2019-09-08 06:37:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:07,649 INFO L93 Difference]: Finished difference Result 15526 states and 30261 transitions. [2019-09-08 06:37:07,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:37:07,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 06:37:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:07,713 INFO L225 Difference]: With dead ends: 15526 [2019-09-08 06:37:07,713 INFO L226 Difference]: Without dead ends: 5901 [2019-09-08 06:37:07,774 INFO L628 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 [2019-09-08 06:37:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5901 states. [2019-09-08 06:37:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5901 to 5880. [2019-09-08 06:37:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5880 states. [2019-09-08 06:37:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5880 states to 5880 states and 9182 transitions. [2019-09-08 06:37:08,058 INFO L78 Accepts]: Start accepts. Automaton has 5880 states and 9182 transitions. Word has length 182 [2019-09-08 06:37:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:08,059 INFO L475 AbstractCegarLoop]: Abstraction has 5880 states and 9182 transitions. [2019-09-08 06:37:08,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:37:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5880 states and 9182 transitions. [2019-09-08 06:37:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 06:37:08,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:37:08,061 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:37:08,061 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:37:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:37:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash -966532255, now seen corresponding path program 1 times [2019-09-08 06:37:08,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:37:08,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:37:08,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:08,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:08,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:37:08,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:37:08,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:37:08,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:37:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:08,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:37:08,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:37:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:37:08,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:37:08,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:37:08,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:37:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:37:08,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:37:08,382 INFO L87 Difference]: Start difference. First operand 5880 states and 9182 transitions. Second operand 7 states. [2019-09-08 06:37:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:08,738 INFO L93 Difference]: Finished difference Result 8857 states and 14055 transitions. [2019-09-08 06:37:08,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:37:08,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-09-08 06:37:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:08,788 INFO L225 Difference]: With dead ends: 8857 [2019-09-08 06:37:08,788 INFO L226 Difference]: Without dead ends: 3157 [2019-09-08 06:37:08,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:37:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2019-09-08 06:37:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 3048. [2019-09-08 06:37:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3048 states. [2019-09-08 06:37:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4038 transitions. [2019-09-08 06:37:09,606 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4038 transitions. Word has length 182 [2019-09-08 06:37:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:09,607 INFO L475 AbstractCegarLoop]: Abstraction has 3048 states and 4038 transitions. [2019-09-08 06:37:09,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:37:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4038 transitions. [2019-09-08 06:37:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 06:37:09,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:37:09,609 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:37:09,609 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:37:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:37:09,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1947667240, now seen corresponding path program 1 times [2019-09-08 06:37:09,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:37:09,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:37:09,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:09,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:09,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 06:37:09,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:37:09,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:37:09,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:10,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 06:37:10,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:37:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 06:37:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:37:10,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 18 [2019-09-08 06:37:10,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 06:37:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 06:37:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:37:10,267 INFO L87 Difference]: Start difference. First operand 3048 states and 4038 transitions. Second operand 18 states. [2019-09-08 06:37:14,252 WARN L188 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-09-08 06:37:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:16,039 INFO L93 Difference]: Finished difference Result 7471 states and 10381 transitions. [2019-09-08 06:37:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 06:37:16,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 191 [2019-09-08 06:37:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:16,110 INFO L225 Difference]: With dead ends: 7471 [2019-09-08 06:37:16,110 INFO L226 Difference]: Without dead ends: 4508 [2019-09-08 06:37:16,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 205 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=445, Invalid=3215, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 06:37:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2019-09-08 06:37:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 4114. [2019-09-08 06:37:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2019-09-08 06:37:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 5483 transitions. [2019-09-08 06:37:16,340 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 5483 transitions. Word has length 191 [2019-09-08 06:37:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:16,340 INFO L475 AbstractCegarLoop]: Abstraction has 4114 states and 5483 transitions. [2019-09-08 06:37:16,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 06:37:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 5483 transitions. [2019-09-08 06:37:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 06:37:16,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:37:16,342 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:37:16,342 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:37:16,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:37:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash -660637360, now seen corresponding path program 1 times [2019-09-08 06:37:16,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:37:16,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:37:16,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:16,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 49 proven. 105 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-08 06:37:16,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:37:16,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:37:16,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:17,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 2146 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 06:37:17,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:37:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 14 proven. 184 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 06:37:17,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:37:17,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 20 [2019-09-08 06:37:17,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:37:17,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:37:17,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:37:17,766 INFO L87 Difference]: Start difference. First operand 4114 states and 5483 transitions. Second operand 20 states. [2019-09-08 06:37:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:27,211 INFO L93 Difference]: Finished difference Result 9960 states and 14001 transitions. [2019-09-08 06:37:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 06:37:27,212 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 301 [2019-09-08 06:37:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:27,274 INFO L225 Difference]: With dead ends: 9960 [2019-09-08 06:37:27,274 INFO L226 Difference]: Without dead ends: 6054 [2019-09-08 06:37:27,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 326 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=688, Invalid=6794, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 06:37:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2019-09-08 06:37:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 5335. [2019-09-08 06:37:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5335 states. [2019-09-08 06:37:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5335 states to 5335 states and 7126 transitions. [2019-09-08 06:37:27,992 INFO L78 Accepts]: Start accepts. Automaton has 5335 states and 7126 transitions. Word has length 301 [2019-09-08 06:37:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:27,992 INFO L475 AbstractCegarLoop]: Abstraction has 5335 states and 7126 transitions. [2019-09-08 06:37:27,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:37:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 5335 states and 7126 transitions. [2019-09-08 06:37:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 06:37:27,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:37:27,995 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 06:37:27,995 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:37:27,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:37:27,995 INFO L82 PathProgramCache]: Analyzing trace with hash -703342744, now seen corresponding path program 1 times [2019-09-08 06:37:27,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:37:27,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:37:27,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:27,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:27,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 77 proven. 186 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-08 06:37:28,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:37:28,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:37:28,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:28,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 06:37:28,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:37:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 21 proven. 379 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-08 06:37:29,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:37:29,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 21 [2019-09-08 06:37:29,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 06:37:29,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 06:37:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-09-08 06:37:29,150 INFO L87 Difference]: Start difference. First operand 5335 states and 7126 transitions. Second operand 21 states. [2019-09-08 06:37:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:37:44,361 INFO L93 Difference]: Finished difference Result 12650 states and 17734 transitions. [2019-09-08 06:37:44,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 06:37:44,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 412 [2019-09-08 06:37:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:37:44,821 INFO L225 Difference]: With dead ends: 12650 [2019-09-08 06:37:44,821 INFO L226 Difference]: Without dead ends: 7514 [2019-09-08 06:37:44,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 452 SyntacticMatches, 5 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4808 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1060, Invalid=13460, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 06:37:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7514 states. [2019-09-08 06:37:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7514 to 6481. [2019-09-08 06:37:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6481 states. [2019-09-08 06:37:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 8692 transitions. [2019-09-08 06:37:45,216 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 8692 transitions. Word has length 412 [2019-09-08 06:37:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:37:45,216 INFO L475 AbstractCegarLoop]: Abstraction has 6481 states and 8692 transitions. [2019-09-08 06:37:45,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 06:37:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 8692 transitions. [2019-09-08 06:37:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-08 06:37:45,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:37:45,220 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-08 06:37:45,220 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:37:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:37:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2091358571, now seen corresponding path program 1 times [2019-09-08 06:37:45,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:37:45,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:37:45,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:45,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:45,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:37:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 157 proven. 231 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2019-09-08 06:37:45,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:37:45,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:37:45,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:37:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:37:46,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 3105 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 06:37:46,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:37:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 28 proven. 637 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-08 06:37:47,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:37:47,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 31 [2019-09-08 06:37:47,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 06:37:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 06:37:47,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2019-09-08 06:37:47,177 INFO L87 Difference]: Start difference. First operand 6481 states and 8692 transitions. Second operand 31 states. [2019-09-08 06:38:08,250 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-09-08 06:38:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:38:13,091 INFO L93 Difference]: Finished difference Result 15789 states and 23370 transitions. [2019-09-08 06:38:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 06:38:13,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 524 [2019-09-08 06:38:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:38:13,203 INFO L225 Difference]: With dead ends: 15789 [2019-09-08 06:38:13,203 INFO L226 Difference]: Without dead ends: 9507 [2019-09-08 06:38:13,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 591 SyntacticMatches, 4 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10717 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2505, Invalid=27251, Unknown=0, NotChecked=0, Total=29756 [2019-09-08 06:38:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9507 states. [2019-09-08 06:38:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9507 to 8097. [2019-09-08 06:38:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8097 states. [2019-09-08 06:38:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8097 states to 8097 states and 11065 transitions. [2019-09-08 06:38:14,433 INFO L78 Accepts]: Start accepts. Automaton has 8097 states and 11065 transitions. Word has length 524 [2019-09-08 06:38:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:38:14,434 INFO L475 AbstractCegarLoop]: Abstraction has 8097 states and 11065 transitions. [2019-09-08 06:38:14,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 06:38:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8097 states and 11065 transitions. [2019-09-08 06:38:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-09-08 06:38:14,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:38:14,441 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-08 06:38:14,442 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:38:14,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:38:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1360140101, now seen corresponding path program 1 times [2019-09-08 06:38:14,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:38:14,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:38:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:14,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 1222 trivial. 0 not checked. [2019-09-08 06:38:14,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:38:14,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:38:14,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:38:14,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:38:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:38:14,778 INFO L87 Difference]: Start difference. First operand 8097 states and 11065 transitions. Second operand 3 states. [2019-09-08 06:38:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:38:15,068 INFO L93 Difference]: Finished difference Result 10524 states and 14679 transitions. [2019-09-08 06:38:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:38:15,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 638 [2019-09-08 06:38:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:38:15,095 INFO L225 Difference]: With dead ends: 10524 [2019-09-08 06:38:15,095 INFO L226 Difference]: Without dead ends: 2512 [2019-09-08 06:38:15,130 INFO L628 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 [2019-09-08 06:38:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-09-08 06:38:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2285. [2019-09-08 06:38:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2019-09-08 06:38:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2720 transitions. [2019-09-08 06:38:15,276 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2720 transitions. Word has length 638 [2019-09-08 06:38:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:38:15,277 INFO L475 AbstractCegarLoop]: Abstraction has 2285 states and 2720 transitions. [2019-09-08 06:38:15,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:38:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2720 transitions. [2019-09-08 06:38:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2019-09-08 06:38:15,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:38:15,284 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-08 06:38:15,285 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:38:15,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:38:15,285 INFO L82 PathProgramCache]: Analyzing trace with hash 448881063, now seen corresponding path program 1 times [2019-09-08 06:38:15,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:38:15,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:38:15,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:15,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:15,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 1222 trivial. 0 not checked. [2019-09-08 06:38:15,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:38:15,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:38:15,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:38:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:38:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:38:15,837 INFO L87 Difference]: Start difference. First operand 2285 states and 2720 transitions. Second operand 8 states. [2019-09-08 06:38:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:38:16,108 INFO L93 Difference]: Finished difference Result 3213 states and 3861 transitions. [2019-09-08 06:38:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:38:16,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 639 [2019-09-08 06:38:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:38:16,120 INFO L225 Difference]: With dead ends: 3213 [2019-09-08 06:38:16,120 INFO L226 Difference]: Without dead ends: 2294 [2019-09-08 06:38:16,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:38:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-09-08 06:38:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2281. [2019-09-08 06:38:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-09-08 06:38:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 2711 transitions. [2019-09-08 06:38:16,257 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 2711 transitions. Word has length 639 [2019-09-08 06:38:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:38:16,257 INFO L475 AbstractCegarLoop]: Abstraction has 2281 states and 2711 transitions. [2019-09-08 06:38:16,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:38:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2711 transitions. [2019-09-08 06:38:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-09-08 06:38:16,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:38:16,262 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:38:16,262 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:38:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:38:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash 558672114, now seen corresponding path program 1 times [2019-09-08 06:38:16,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:38:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:38:16,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:16,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2019-09-08 06:38:16,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:38:16,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:38:16,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:38:16,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:38:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:38:16,497 INFO L87 Difference]: Start difference. First operand 2281 states and 2711 transitions. Second operand 3 states. [2019-09-08 06:38:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:38:16,610 INFO L93 Difference]: Finished difference Result 3833 states and 4411 transitions. [2019-09-08 06:38:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:38:16,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 666 [2019-09-08 06:38:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:38:16,618 INFO L225 Difference]: With dead ends: 3833 [2019-09-08 06:38:16,618 INFO L226 Difference]: Without dead ends: 1271 [2019-09-08 06:38:16,623 INFO L628 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 [2019-09-08 06:38:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-09-08 06:38:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 929. [2019-09-08 06:38:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-08 06:38:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 970 transitions. [2019-09-08 06:38:16,914 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 970 transitions. Word has length 666 [2019-09-08 06:38:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:38:16,914 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 970 transitions. [2019-09-08 06:38:16,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:38:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 970 transitions. [2019-09-08 06:38:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2019-09-08 06:38:16,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:38:16,917 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-08 06:38:16,918 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:38:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:38:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1578169104, now seen corresponding path program 1 times [2019-09-08 06:38:16,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:38:16,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:38:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:16,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 1222 trivial. 0 not checked. [2019-09-08 06:38:17,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:38:17,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:38:17,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:38:17,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:38:17,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:38:17,206 INFO L87 Difference]: Start difference. First operand 929 states and 970 transitions. Second operand 5 states. [2019-09-08 06:38:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:38:17,301 INFO L93 Difference]: Finished difference Result 1079 states and 1129 transitions. [2019-09-08 06:38:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:38:17,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 640 [2019-09-08 06:38:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:38:17,304 INFO L225 Difference]: With dead ends: 1079 [2019-09-08 06:38:17,304 INFO L226 Difference]: Without dead ends: 906 [2019-09-08 06:38:17,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:38:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-08 06:38:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2019-09-08 06:38:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-08 06:38:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 933 transitions. [2019-09-08 06:38:17,364 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 933 transitions. Word has length 640 [2019-09-08 06:38:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:38:17,365 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 933 transitions. [2019-09-08 06:38:17,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:38:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 933 transitions. [2019-09-08 06:38:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-09-08 06:38:17,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:38:17,370 INFO L399 BasicCegarLoop]: trace histogram [12, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:38:17,370 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:38:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:38:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash -722433483, now seen corresponding path program 1 times [2019-09-08 06:38:17,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:38:17,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:38:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:17,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1499 backedges. 110 proven. 429 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2019-09-08 06:38:18,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:38:18,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:38:18,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:19,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 3814 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 06:38:19,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:38:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1499 backedges. 223 proven. 380 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2019-09-08 06:38:19,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:38:19,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 46 [2019-09-08 06:38:19,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 06:38:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 06:38:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1924, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 06:38:19,910 INFO L87 Difference]: Start difference. First operand 906 states and 933 transitions. Second operand 46 states. [2019-09-08 06:38:20,997 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-09-08 06:38:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:38:26,809 INFO L93 Difference]: Finished difference Result 1001 states and 1029 transitions. [2019-09-08 06:38:26,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 06:38:26,809 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 701 [2019-09-08 06:38:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:38:26,812 INFO L225 Difference]: With dead ends: 1001 [2019-09-08 06:38:26,812 INFO L226 Difference]: Without dead ends: 998 [2019-09-08 06:38:26,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=787, Invalid=7769, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 06:38:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-08 06:38:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 974. [2019-09-08 06:38:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-08 06:38:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1002 transitions. [2019-09-08 06:38:26,885 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1002 transitions. Word has length 701 [2019-09-08 06:38:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:38:26,886 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1002 transitions. [2019-09-08 06:38:26,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 06:38:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1002 transitions. [2019-09-08 06:38:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2019-09-08 06:38:26,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:38:26,890 INFO L399 BasicCegarLoop]: trace histogram [13, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-09-08 06:38:26,891 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:38:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:38:26,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1330633357, now seen corresponding path program 1 times [2019-09-08 06:38:26,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:38:26,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:38:26,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:26,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:26,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1678 backedges. 222 proven. 176 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2019-09-08 06:38:27,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:38:27,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:38:27,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:28,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 4032 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 06:38:28,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:38:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1678 backedges. 399 proven. 55 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2019-09-08 06:38:28,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:38:28,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 16 [2019-09-08 06:38:28,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 06:38:28,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 06:38:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:38:28,964 INFO L87 Difference]: Start difference. First operand 974 states and 1002 transitions. Second operand 16 states. [2019-09-08 06:38:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:38:31,731 INFO L93 Difference]: Finished difference Result 1218 states and 1260 transitions. [2019-09-08 06:38:31,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 06:38:31,734 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 756 [2019-09-08 06:38:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:38:31,737 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 06:38:31,737 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 06:38:31,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 775 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 06:38:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 06:38:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1029. [2019-09-08 06:38:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-09-08 06:38:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1058 transitions. [2019-09-08 06:38:31,857 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1058 transitions. Word has length 756 [2019-09-08 06:38:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:38:31,860 INFO L475 AbstractCegarLoop]: Abstraction has 1029 states and 1058 transitions. [2019-09-08 06:38:31,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 06:38:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1058 transitions. [2019-09-08 06:38:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-09-08 06:38:31,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:38:31,868 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:38:31,868 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:38:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:38:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash 984734173, now seen corresponding path program 1 times [2019-09-08 06:38:31,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:38:31,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:38:31,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:31,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:31,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 424 proven. 762 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2019-09-08 06:38:33,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:38:33,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:38:33,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:34,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 4282 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 06:38:34,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:38:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 407 proven. 991 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-09-08 06:38:36,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:38:36,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 61 [2019-09-08 06:38:36,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 06:38:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 06:38:36,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3493, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 06:38:36,036 INFO L87 Difference]: Start difference. First operand 1029 states and 1058 transitions. Second operand 61 states. [2019-09-08 06:38:46,403 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-09-08 06:38:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:38:54,284 INFO L93 Difference]: Finished difference Result 1122 states and 1153 transitions. [2019-09-08 06:38:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 06:38:54,285 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 819 [2019-09-08 06:38:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:38:54,288 INFO L225 Difference]: With dead ends: 1122 [2019-09-08 06:38:54,288 INFO L226 Difference]: Without dead ends: 1119 [2019-09-08 06:38:54,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 839 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1375, Invalid=17531, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 06:38:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-09-08 06:38:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1096. [2019-09-08 06:38:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-09-08 06:38:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1127 transitions. [2019-09-08 06:38:54,390 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1127 transitions. Word has length 819 [2019-09-08 06:38:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:38:54,390 INFO L475 AbstractCegarLoop]: Abstraction has 1096 states and 1127 transitions. [2019-09-08 06:38:54,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 06:38:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1127 transitions. [2019-09-08 06:38:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2019-09-08 06:38:54,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:38:54,399 INFO L399 BasicCegarLoop]: trace histogram [15, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:38:54,399 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:38:54,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:38:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1257744181, now seen corresponding path program 1 times [2019-09-08 06:38:54,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:38:54,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:38:54,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:54,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:54,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:38:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2134 backedges. 529 proven. 45 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-08 06:38:55,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:38:55,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:38:55,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:38:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:38:55,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 4500 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 06:38:55,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:38:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2134 backedges. 672 proven. 195 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2019-09-08 06:38:56,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:38:56,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 22 [2019-09-08 06:38:56,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 06:38:56,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 06:38:56,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 06:38:56,521 INFO L87 Difference]: Start difference. First operand 1096 states and 1127 transitions. Second operand 22 states. [2019-09-08 06:39:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:01,775 INFO L93 Difference]: Finished difference Result 1433 states and 1483 transitions. [2019-09-08 06:39:01,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 06:39:01,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 874 [2019-09-08 06:39:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:01,780 INFO L225 Difference]: With dead ends: 1433 [2019-09-08 06:39:01,781 INFO L226 Difference]: Without dead ends: 1236 [2019-09-08 06:39:01,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 887 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=548, Invalid=5304, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 06:39:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-09-08 06:39:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1180. [2019-09-08 06:39:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-09-08 06:39:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1212 transitions. [2019-09-08 06:39:01,945 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1212 transitions. Word has length 874 [2019-09-08 06:39:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:01,946 INFO L475 AbstractCegarLoop]: Abstraction has 1180 states and 1212 transitions. [2019-09-08 06:39:01,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 06:39:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1212 transitions. [2019-09-08 06:39:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 939 [2019-09-08 06:39:01,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:01,956 INFO L399 BasicCegarLoop]: trace histogram [16, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:01,956 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1731186014, now seen corresponding path program 1 times [2019-09-08 06:39:01,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:01,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:01,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:02,779 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-09-08 06:39:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2425 backedges. 723 proven. 978 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2019-09-08 06:39:03,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:03,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:03,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:04,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 4751 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-08 06:39:04,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2425 backedges. 498 proven. 1629 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-09-08 06:39:06,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:39:06,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 40] total 66 [2019-09-08 06:39:06,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 06:39:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 06:39:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=4107, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 06:39:06,802 INFO L87 Difference]: Start difference. First operand 1180 states and 1212 transitions. Second operand 66 states. [2019-09-08 06:39:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:34,131 INFO L93 Difference]: Finished difference Result 1352 states and 1389 transitions. [2019-09-08 06:39:34,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-08 06:39:34,131 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 938 [2019-09-08 06:39:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:34,135 INFO L225 Difference]: With dead ends: 1352 [2019-09-08 06:39:34,135 INFO L226 Difference]: Without dead ends: 1349 [2019-09-08 06:39:34,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1117 GetRequests, 945 SyntacticMatches, 12 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1690, Invalid=24392, Unknown=0, NotChecked=0, Total=26082 [2019-09-08 06:39:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-09-08 06:39:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1223. [2019-09-08 06:39:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-09-08 06:39:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1257 transitions. [2019-09-08 06:39:34,248 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1257 transitions. Word has length 938 [2019-09-08 06:39:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:34,248 INFO L475 AbstractCegarLoop]: Abstraction has 1223 states and 1257 transitions. [2019-09-08 06:39:34,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 06:39:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1257 transitions. [2019-09-08 06:39:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2019-09-08 06:39:34,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:34,256 INFO L399 BasicCegarLoop]: trace histogram [17, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:34,256 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:34,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1393244118, now seen corresponding path program 1 times [2019-09-08 06:39:34,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:34,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:34,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:34,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:34,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 696 proven. 46 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [2019-09-08 06:39:35,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:35,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:35,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:35,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 4969 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 06:39:35,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 945 proven. 400 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2019-09-08 06:39:36,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:39:36,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 23 [2019-09-08 06:39:36,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 06:39:36,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 06:39:36,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:39:36,683 INFO L87 Difference]: Start difference. First operand 1223 states and 1257 transitions. Second operand 23 states. [2019-09-08 06:39:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:43,890 INFO L93 Difference]: Finished difference Result 1791 states and 1853 transitions. [2019-09-08 06:39:43,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 06:39:43,891 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 993 [2019-09-08 06:39:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:43,896 INFO L225 Difference]: With dead ends: 1791 [2019-09-08 06:39:43,896 INFO L226 Difference]: Without dead ends: 1467 [2019-09-08 06:39:43,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 1002 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2254 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=688, Invalid=7684, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 06:39:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-09-08 06:39:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1308. [2019-09-08 06:39:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-09-08 06:39:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1343 transitions. [2019-09-08 06:39:44,083 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1343 transitions. Word has length 993 [2019-09-08 06:39:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:44,084 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 1343 transitions. [2019-09-08 06:39:44,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 06:39:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1343 transitions. [2019-09-08 06:39:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1059 [2019-09-08 06:39:44,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:44,095 INFO L399 BasicCegarLoop]: trace histogram [18, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:44,096 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash -952919893, now seen corresponding path program 1 times [2019-09-08 06:39:44,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:44,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:44,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:44,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:44,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 1160 proven. 1190 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-09-08 06:39:46,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:46,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:46,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:46,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 5221 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-08 06:39:46,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 495 proven. 2251 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2019-09-08 06:39:50,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:39:50,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43] total 76 [2019-09-08 06:39:50,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 06:39:50,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 06:39:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=5483, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 06:39:50,227 INFO L87 Difference]: Start difference. First operand 1308 states and 1343 transitions. Second operand 76 states. [2019-09-08 06:40:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:28,059 INFO L93 Difference]: Finished difference Result 1523 states and 1561 transitions. [2019-09-08 06:40:28,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 06:40:28,060 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 1058 [2019-09-08 06:40:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:28,064 INFO L225 Difference]: With dead ends: 1523 [2019-09-08 06:40:28,064 INFO L226 Difference]: Without dead ends: 1520 [2019-09-08 06:40:28,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1282 GetRequests, 1073 SyntacticMatches, 12 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11047 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2228, Invalid=37174, Unknown=0, NotChecked=0, Total=39402 [2019-09-08 06:40:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-09-08 06:40:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1373. [2019-09-08 06:40:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-09-08 06:40:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1408 transitions. [2019-09-08 06:40:28,209 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1408 transitions. Word has length 1058 [2019-09-08 06:40:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:28,209 INFO L475 AbstractCegarLoop]: Abstraction has 1373 states and 1408 transitions. [2019-09-08 06:40:28,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 06:40:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1408 transitions. [2019-09-08 06:40:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2019-09-08 06:40:28,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:28,218 INFO L399 BasicCegarLoop]: trace histogram [19, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:40:28,218 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:28,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1231058371, now seen corresponding path program 1 times [2019-09-08 06:40:28,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:28,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:28,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:28,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:28,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3428 backedges. 867 proven. 45 refuted. 0 times theorem prover too weak. 2516 trivial. 0 not checked. [2019-09-08 06:40:29,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:40:29,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:40:29,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:29,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 5439 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 06:40:29,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:40:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3428 backedges. 1218 proven. 671 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2019-09-08 06:40:30,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:40:30,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 29 [2019-09-08 06:40:30,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 06:40:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 06:40:30,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=752, Unknown=0, NotChecked=0, Total=812 [2019-09-08 06:40:30,900 INFO L87 Difference]: Start difference. First operand 1373 states and 1408 transitions. Second operand 29 states. [2019-09-08 06:40:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:39,135 INFO L93 Difference]: Finished difference Result 1797 states and 1851 transitions. [2019-09-08 06:40:39,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 06:40:39,136 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1113 [2019-09-08 06:40:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:39,140 INFO L225 Difference]: With dead ends: 1797 [2019-09-08 06:40:39,141 INFO L226 Difference]: Without dead ends: 1320 [2019-09-08 06:40:39,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1218 GetRequests, 1114 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=800, Invalid=9502, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 06:40:39,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-09-08 06:40:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2019-09-08 06:40:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-09-08 06:40:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1348 transitions. [2019-09-08 06:40:39,266 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1348 transitions. Word has length 1113 [2019-09-08 06:40:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:39,267 INFO L475 AbstractCegarLoop]: Abstraction has 1320 states and 1348 transitions. [2019-09-08 06:40:39,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 06:40:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1348 transitions. [2019-09-08 06:40:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1180 [2019-09-08 06:40:39,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:39,276 INFO L399 BasicCegarLoop]: trace histogram [20, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:40:39,276 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1689091755, now seen corresponding path program 1 times [2019-09-08 06:40:39,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:39,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:39,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:39,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:39,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 1706 proven. 655 refuted. 0 times theorem prover too weak. 1498 trivial. 0 not checked. [2019-09-08 06:40:41,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:40:41,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:40:41,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:42,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 5692 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-08 06:40:42,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:40:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 398 proven. 2856 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-08 06:40:46,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:40:46,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 45] total 76 [2019-09-08 06:40:46,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 06:40:46,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 06:40:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=5483, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 06:40:46,038 INFO L87 Difference]: Start difference. First operand 1320 states and 1348 transitions. Second operand 76 states. [2019-09-08 06:41:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:36,442 INFO L93 Difference]: Finished difference Result 2118 states and 2160 transitions. [2019-09-08 06:41:36,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-08 06:41:36,443 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 1179 [2019-09-08 06:41:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:36,448 INFO L225 Difference]: With dead ends: 2118 [2019-09-08 06:41:36,448 INFO L226 Difference]: Without dead ends: 1495 [2019-09-08 06:41:36,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1455 GetRequests, 1182 SyntacticMatches, 14 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22763 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=3510, Invalid=64350, Unknown=0, NotChecked=0, Total=67860 [2019-09-08 06:41:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2019-09-08 06:41:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1460. [2019-09-08 06:41:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-09-08 06:41:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1489 transitions. [2019-09-08 06:41:36,596 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1489 transitions. Word has length 1179 [2019-09-08 06:41:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:36,596 INFO L475 AbstractCegarLoop]: Abstraction has 1460 states and 1489 transitions. [2019-09-08 06:41:36,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 06:41:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1489 transitions. [2019-09-08 06:41:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1293 [2019-09-08 06:41:36,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:36,607 INFO L399 BasicCegarLoop]: trace histogram [22, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-08 06:41:36,607 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash 917783352, now seen corresponding path program 2 times [2019-09-08 06:41:36,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:36,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4731 backedges. 540 proven. 652 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2019-09-08 06:41:38,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:38,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:38,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:41:38,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:41:38,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:41:38,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 6173 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 06:41:38,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4731 backedges. 2466 proven. 238 refuted. 0 times theorem prover too weak. 2027 trivial. 0 not checked. [2019-09-08 06:41:39,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:41:39,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 20 [2019-09-08 06:41:39,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:41:39,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:41:39,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:41:39,807 INFO L87 Difference]: Start difference. First operand 1460 states and 1489 transitions. Second operand 20 states. [2019-09-08 06:41:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:43,206 INFO L93 Difference]: Finished difference Result 1460 states and 1489 transitions. [2019-09-08 06:41:43,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 06:41:43,206 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1292 [2019-09-08 06:41:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:43,207 INFO L225 Difference]: With dead ends: 1460 [2019-09-08 06:41:43,207 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 06:41:43,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1377 GetRequests, 1324 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=592, Invalid=2378, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 06:41:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 06:41:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 06:41:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 06:41:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 06:41:43,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1292 [2019-09-08 06:41:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:43,212 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 06:41:43,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:41:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 06:41:43,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 06:41:43,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 06:41:46,977 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:41:50,695 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-08 06:41:53,810 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 06:41:56,457 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-09-08 06:41:59,359 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:42:02,655 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:42:02,985 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 538 DAG size of output: 200 [2019-09-08 06:42:03,729 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 538 DAG size of output: 200 [2019-09-08 06:42:06,231 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-09-08 06:42:09,385 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 538 DAG size of output: 200 [2019-09-08 06:42:09,947 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:42:13,305 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:42:16,254 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 06:42:19,378 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-08 06:42:22,551 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 06:42:25,744 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 06:42:29,167 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:42:30,061 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 538 DAG size of output: 200 [2019-09-08 06:42:30,490 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 261 [2019-09-08 06:42:32,921 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 538 DAG size of output: 200 [2019-09-08 06:42:33,214 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:42:36,538 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:42:48,309 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 434 DAG size of output: 165 [2019-09-08 06:42:49,650 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 60 [2019-09-08 06:42:52,621 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 60 [2019-09-08 06:42:55,658 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 60 [2019-09-08 06:43:12,621 WARN L188 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 216 DAG size of output: 60 [2019-09-08 06:43:14,095 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 492 DAG size of output: 300 [2019-09-08 06:43:26,075 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 538 DAG size of output: 200