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/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:45:36,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:45:36,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:45:36,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:45:36,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:45:36,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:45:36,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:45:36,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:45:36,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:45:36,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:45:36,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:45:36,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:45:36,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:45:36,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:45:36,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:45:36,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:45:36,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:45:36,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:45:36,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:45:36,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:45:36,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:45:36,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:45:36,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:45:36,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:45:36,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:45:36,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:45:36,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:45:36,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:45:36,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:45:36,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:45:36,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:45:36,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:45:36,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:45:36,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:45:36,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:45:36,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:45:36,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:45:36,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:45:36,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:45:36,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:45:36,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:45:36,699 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 12:45:36,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:45:36,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:45:36,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:45:36,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:45:36,721 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:45:36,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:45:36,722 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:45:36,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:45:36,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:45:36,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:45:36,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:45:36,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:45:36,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:45:36,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:45:36,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:45:36,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:45:36,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:45:36,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:45:36,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:45:36,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:45:36,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:45:36,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:45:36,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:45:36,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:45:36,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:45:36,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:45:36,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:45:36,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:45:36,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:45:36,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:45:36,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:45:36,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:45:36,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:45:36,775 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:45:36,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2019-09-08 12:45:36,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3b4a249/1e6f4ee86c4e4432b1cb560a0318eb00/FLAG8de2f4e5c [2019-09-08 12:45:37,361 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:45:37,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2019-09-08 12:45:37,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3b4a249/1e6f4ee86c4e4432b1cb560a0318eb00/FLAG8de2f4e5c [2019-09-08 12:45:37,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3b4a249/1e6f4ee86c4e4432b1cb560a0318eb00 [2019-09-08 12:45:37,684 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:45:37,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:45:37,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:45:37,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:45:37,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:45:37,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:45:37" (1/1) ... [2019-09-08 12:45:37,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c3f56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:37, skipping insertion in model container [2019-09-08 12:45:37,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:45:37" (1/1) ... [2019-09-08 12:45:37,702 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:45:37,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:45:38,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:45:38,288 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:45:38,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:45:38,447 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:45:38,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38 WrapperNode [2019-09-08 12:45:38,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:45:38,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:45:38,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:45:38,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:45:38,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (1/1) ... [2019-09-08 12:45:38,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (1/1) ... [2019-09-08 12:45:38,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (1/1) ... [2019-09-08 12:45:38,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (1/1) ... [2019-09-08 12:45:38,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (1/1) ... [2019-09-08 12:45:38,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (1/1) ... [2019-09-08 12:45:38,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (1/1) ... [2019-09-08 12:45:38,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:45:38,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:45:38,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:45:38,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:45:38,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (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 12:45:38,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:45:38,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:45:38,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:45:38,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:45:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:45:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:45:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:45:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:45:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:45:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:45:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:45:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:45:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:45:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:45:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:45:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:45:38,654 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:45:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 12:45:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:45:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:45:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:45:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:45:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:45:39,934 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:45:39,935 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:45:39,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:45:39 BoogieIcfgContainer [2019-09-08 12:45:39,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:45:39,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:45:39,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:45:39,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:45:39,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:45:37" (1/3) ... [2019-09-08 12:45:39,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd59f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:45:39, skipping insertion in model container [2019-09-08 12:45:39,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:38" (2/3) ... [2019-09-08 12:45:39,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd59f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:45:39, skipping insertion in model container [2019-09-08 12:45:39,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:45:39" (3/3) ... [2019-09-08 12:45:39,950 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2019-09-08 12:45:39,957 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:45:39,970 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:45:39,988 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:45:40,026 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:45:40,027 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:45:40,027 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:45:40,027 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:45:40,027 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:45:40,027 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:45:40,027 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:45:40,027 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:45:40,027 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:45:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-09-08 12:45:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:45:40,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:40,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:40,066 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 946544579, now seen corresponding path program 1 times [2019-09-08 12:45:40,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:40,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:40,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:40,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:40,706 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 12:45:40,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:40,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:40,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:40,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:40,731 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2019-09-08 12:45:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:40,963 INFO L93 Difference]: Finished difference Result 454 states and 757 transitions. [2019-09-08 12:45:40,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:40,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 12:45:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:40,983 INFO L225 Difference]: With dead ends: 454 [2019-09-08 12:45:40,983 INFO L226 Difference]: Without dead ends: 351 [2019-09-08 12:45:40,988 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 12:45:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-08 12:45:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-09-08 12:45:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-08 12:45:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 498 transitions. [2019-09-08 12:45:41,067 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 498 transitions. Word has length 129 [2019-09-08 12:45:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:41,069 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 498 transitions. [2019-09-08 12:45:41,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 498 transitions. [2019-09-08 12:45:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:45:41,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:41,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:41,074 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:41,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1962264158, now seen corresponding path program 1 times [2019-09-08 12:45:41,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:41,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:41,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:41,426 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 12:45:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:41,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:41,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:41,429 INFO L87 Difference]: Start difference. First operand 349 states and 498 transitions. Second operand 5 states. [2019-09-08 12:45:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:41,945 INFO L93 Difference]: Finished difference Result 859 states and 1291 transitions. [2019-09-08 12:45:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:41,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-09-08 12:45:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:41,951 INFO L225 Difference]: With dead ends: 859 [2019-09-08 12:45:41,951 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 12:45:41,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 12:45:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2019-09-08 12:45:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 12:45:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 862 transitions. [2019-09-08 12:45:42,006 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 862 transitions. Word has length 131 [2019-09-08 12:45:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:42,007 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 862 transitions. [2019-09-08 12:45:42,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 862 transitions. [2019-09-08 12:45:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:45:42,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:42,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:42,015 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash 465547919, now seen corresponding path program 1 times [2019-09-08 12:45:42,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:42,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:42,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:42,263 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 12:45:42,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:42,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:42,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:42,266 INFO L87 Difference]: Start difference. First operand 580 states and 862 transitions. Second operand 5 states. [2019-09-08 12:45:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:42,538 INFO L93 Difference]: Finished difference Result 1060 states and 1617 transitions. [2019-09-08 12:45:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:42,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-08 12:45:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:42,545 INFO L225 Difference]: With dead ends: 1060 [2019-09-08 12:45:42,545 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 12:45:42,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 12:45:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 12:45:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 12:45:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 857 transitions. [2019-09-08 12:45:42,604 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 857 transitions. Word has length 132 [2019-09-08 12:45:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:42,606 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 857 transitions. [2019-09-08 12:45:42,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 857 transitions. [2019-09-08 12:45:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:45:42,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:42,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:42,613 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash 813385873, now seen corresponding path program 1 times [2019-09-08 12:45:42,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:42,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:42,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:42,772 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 12:45:42,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:42,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:42,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:42,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:42,775 INFO L87 Difference]: Start difference. First operand 580 states and 857 transitions. Second operand 5 states. [2019-09-08 12:45:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:43,080 INFO L93 Difference]: Finished difference Result 1084 states and 1637 transitions. [2019-09-08 12:45:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:43,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 12:45:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:43,084 INFO L225 Difference]: With dead ends: 1084 [2019-09-08 12:45:43,085 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 12:45:43,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 12:45:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 12:45:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 12:45:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 852 transitions. [2019-09-08 12:45:43,126 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 852 transitions. Word has length 133 [2019-09-08 12:45:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:43,126 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 852 transitions. [2019-09-08 12:45:43,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 852 transitions. [2019-09-08 12:45:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:45:43,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:43,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:43,130 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash 955484463, now seen corresponding path program 1 times [2019-09-08 12:45:43,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:43,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:43,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:43,300 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 12:45:43,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:43,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:43,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:43,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:43,303 INFO L87 Difference]: Start difference. First operand 580 states and 852 transitions. Second operand 5 states. [2019-09-08 12:45:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:43,559 INFO L93 Difference]: Finished difference Result 1064 states and 1603 transitions. [2019-09-08 12:45:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:43,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 12:45:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:43,564 INFO L225 Difference]: With dead ends: 1064 [2019-09-08 12:45:43,565 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 12:45:43,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 12:45:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 12:45:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 12:45:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 847 transitions. [2019-09-08 12:45:43,603 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 847 transitions. Word has length 134 [2019-09-08 12:45:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:43,604 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 847 transitions. [2019-09-08 12:45:43,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 847 transitions. [2019-09-08 12:45:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:45:43,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:43,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:43,606 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:43,607 INFO L82 PathProgramCache]: Analyzing trace with hash 942845888, now seen corresponding path program 1 times [2019-09-08 12:45:43,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:43,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:43,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:43,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:43,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 12:45:43,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:43,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:43,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:43,799 INFO L87 Difference]: Start difference. First operand 580 states and 847 transitions. Second operand 5 states. [2019-09-08 12:45:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:44,096 INFO L93 Difference]: Finished difference Result 1076 states and 1608 transitions. [2019-09-08 12:45:44,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:44,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-08 12:45:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:44,104 INFO L225 Difference]: With dead ends: 1076 [2019-09-08 12:45:44,104 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 12:45:44,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 12:45:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 12:45:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 12:45:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 842 transitions. [2019-09-08 12:45:44,143 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 842 transitions. Word has length 135 [2019-09-08 12:45:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:44,146 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 842 transitions. [2019-09-08 12:45:44,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 842 transitions. [2019-09-08 12:45:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:45:44,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:44,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:44,152 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:44,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:44,153 INFO L82 PathProgramCache]: Analyzing trace with hash -178047234, now seen corresponding path program 1 times [2019-09-08 12:45:44,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:44,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:44,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:44,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:44,312 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 12:45:44,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:44,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:44,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:44,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:44,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:44,316 INFO L87 Difference]: Start difference. First operand 580 states and 842 transitions. Second operand 5 states. [2019-09-08 12:45:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:44,556 INFO L93 Difference]: Finished difference Result 1072 states and 1594 transitions. [2019-09-08 12:45:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:44,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-08 12:45:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:44,560 INFO L225 Difference]: With dead ends: 1072 [2019-09-08 12:45:44,560 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 12:45:44,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 12:45:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 12:45:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 12:45:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 837 transitions. [2019-09-08 12:45:44,601 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 837 transitions. Word has length 136 [2019-09-08 12:45:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:44,602 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 837 transitions. [2019-09-08 12:45:44,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 837 transitions. [2019-09-08 12:45:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:45:44,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:44,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:44,605 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:44,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash -571169295, now seen corresponding path program 1 times [2019-09-08 12:45:44,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:44,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:44,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:44,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:44,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:44,751 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 12:45:44,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:44,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:44,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:44,754 INFO L87 Difference]: Start difference. First operand 580 states and 837 transitions. Second operand 5 states. [2019-09-08 12:45:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:45,021 INFO L93 Difference]: Finished difference Result 1080 states and 1593 transitions. [2019-09-08 12:45:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:45,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-08 12:45:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:45,025 INFO L225 Difference]: With dead ends: 1080 [2019-09-08 12:45:45,026 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 12:45:45,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 12:45:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 12:45:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 12:45:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 832 transitions. [2019-09-08 12:45:45,063 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 832 transitions. Word has length 137 [2019-09-08 12:45:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:45,063 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 832 transitions. [2019-09-08 12:45:45,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 832 transitions. [2019-09-08 12:45:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:45:45,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:45,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:45,066 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:45,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:45,066 INFO L82 PathProgramCache]: Analyzing trace with hash -42273280, now seen corresponding path program 1 times [2019-09-08 12:45:45,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:45,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:45,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:45,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:45,220 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 12:45:45,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:45,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:45,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:45,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:45,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:45,223 INFO L87 Difference]: Start difference. First operand 580 states and 832 transitions. Second operand 5 states. [2019-09-08 12:45:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:45,535 INFO L93 Difference]: Finished difference Result 1068 states and 1571 transitions. [2019-09-08 12:45:45,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:45,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-08 12:45:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:45,540 INFO L225 Difference]: With dead ends: 1068 [2019-09-08 12:45:45,540 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 12:45:45,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 12:45:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 12:45:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 12:45:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 827 transitions. [2019-09-08 12:45:45,581 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 827 transitions. Word has length 138 [2019-09-08 12:45:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:45,582 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 827 transitions. [2019-09-08 12:45:45,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 827 transitions. [2019-09-08 12:45:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:45,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:45,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:45,585 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1267915042, now seen corresponding path program 1 times [2019-09-08 12:45:45,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:45,887 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 12:45:45,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:45,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:45:45,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:45:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:45:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:45:45,890 INFO L87 Difference]: Start difference. First operand 580 states and 827 transitions. Second operand 10 states. [2019-09-08 12:45:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:46,761 INFO L93 Difference]: Finished difference Result 3674 states and 5473 transitions. [2019-09-08 12:45:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:45:46,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2019-09-08 12:45:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:46,790 INFO L225 Difference]: With dead ends: 3674 [2019-09-08 12:45:46,790 INFO L226 Difference]: Without dead ends: 3324 [2019-09-08 12:45:46,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:45:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2019-09-08 12:45:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 753. [2019-09-08 12:45:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-09-08 12:45:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1088 transitions. [2019-09-08 12:45:47,023 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1088 transitions. Word has length 139 [2019-09-08 12:45:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:47,024 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1088 transitions. [2019-09-08 12:45:47,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:45:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1088 transitions. [2019-09-08 12:45:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:47,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:47,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:47,026 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash -44652639, now seen corresponding path program 1 times [2019-09-08 12:45:47,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:47,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:47,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:47,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:47,269 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 12:45:47,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:47,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:47,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:47,271 INFO L87 Difference]: Start difference. First operand 753 states and 1088 transitions. Second operand 5 states. [2019-09-08 12:45:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:47,599 INFO L93 Difference]: Finished difference Result 1792 states and 2651 transitions. [2019-09-08 12:45:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:47,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 12:45:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:47,609 INFO L225 Difference]: With dead ends: 1792 [2019-09-08 12:45:47,609 INFO L226 Difference]: Without dead ends: 1442 [2019-09-08 12:45:47,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:45:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-09-08 12:45:47,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1172. [2019-09-08 12:45:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-09-08 12:45:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1725 transitions. [2019-09-08 12:45:47,793 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1725 transitions. Word has length 139 [2019-09-08 12:45:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:47,793 INFO L475 AbstractCegarLoop]: Abstraction has 1172 states and 1725 transitions. [2019-09-08 12:45:47,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1725 transitions. [2019-09-08 12:45:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:47,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:47,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:47,796 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:47,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1504481102, now seen corresponding path program 1 times [2019-09-08 12:45:47,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:47,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:47,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:47,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:47,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:47,946 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 12:45:47,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:47,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:47,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:47,948 INFO L87 Difference]: Start difference. First operand 1172 states and 1725 transitions. Second operand 5 states. [2019-09-08 12:45:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:48,364 INFO L93 Difference]: Finished difference Result 2328 states and 3462 transitions. [2019-09-08 12:45:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:48,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 12:45:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:48,377 INFO L225 Difference]: With dead ends: 2328 [2019-09-08 12:45:48,377 INFO L226 Difference]: Without dead ends: 1800 [2019-09-08 12:45:48,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:45:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2019-09-08 12:45:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1550. [2019-09-08 12:45:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-08 12:45:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2297 transitions. [2019-09-08 12:45:48,609 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2297 transitions. Word has length 139 [2019-09-08 12:45:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:48,609 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2297 transitions. [2019-09-08 12:45:48,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2297 transitions. [2019-09-08 12:45:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:48,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:48,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:48,612 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:48,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:48,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1878119452, now seen corresponding path program 1 times [2019-09-08 12:45:48,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:48,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:48,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:48,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:48,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:48,757 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 12:45:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:48,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:48,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:48,759 INFO L87 Difference]: Start difference. First operand 1550 states and 2297 transitions. Second operand 5 states. [2019-09-08 12:45:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:49,213 INFO L93 Difference]: Finished difference Result 2824 states and 4211 transitions. [2019-09-08 12:45:49,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:49,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 12:45:49,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:49,224 INFO L225 Difference]: With dead ends: 2824 [2019-09-08 12:45:49,224 INFO L226 Difference]: Without dead ends: 1940 [2019-09-08 12:45:49,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:45:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2019-09-08 12:45:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1730. [2019-09-08 12:45:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2019-09-08 12:45:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2568 transitions. [2019-09-08 12:45:49,446 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2568 transitions. Word has length 139 [2019-09-08 12:45:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:49,446 INFO L475 AbstractCegarLoop]: Abstraction has 1730 states and 2568 transitions. [2019-09-08 12:45:49,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2568 transitions. [2019-09-08 12:45:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:49,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:49,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:49,449 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1752786018, now seen corresponding path program 1 times [2019-09-08 12:45:49,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:49,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:49,582 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 12:45:49,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:49,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:49,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:49,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:49,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:49,584 INFO L87 Difference]: Start difference. First operand 1730 states and 2568 transitions. Second operand 5 states. [2019-09-08 12:45:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:50,063 INFO L93 Difference]: Finished difference Result 3158 states and 4717 transitions. [2019-09-08 12:45:50,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:50,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 12:45:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:50,077 INFO L225 Difference]: With dead ends: 3158 [2019-09-08 12:45:50,077 INFO L226 Difference]: Without dead ends: 2096 [2019-09-08 12:45:50,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:45:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-09-08 12:45:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1908. [2019-09-08 12:45:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1908 states. [2019-09-08 12:45:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2837 transitions. [2019-09-08 12:45:50,415 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2837 transitions. Word has length 139 [2019-09-08 12:45:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:50,415 INFO L475 AbstractCegarLoop]: Abstraction has 1908 states and 2837 transitions. [2019-09-08 12:45:50,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2837 transitions. [2019-09-08 12:45:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:50,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:50,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:50,418 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:50,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -242497816, now seen corresponding path program 1 times [2019-09-08 12:45:50,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:50,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:50,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:50,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:50,514 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 12:45:50,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:50,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:50,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:50,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:50,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:50,516 INFO L87 Difference]: Start difference. First operand 1908 states and 2837 transitions. Second operand 3 states. [2019-09-08 12:45:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:50,940 INFO L93 Difference]: Finished difference Result 4984 states and 7439 transitions. [2019-09-08 12:45:50,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:50,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 12:45:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:50,958 INFO L225 Difference]: With dead ends: 4984 [2019-09-08 12:45:50,958 INFO L226 Difference]: Without dead ends: 3388 [2019-09-08 12:45:50,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 12:45:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-09-08 12:45:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3386. [2019-09-08 12:45:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-09-08 12:45:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4998 transitions. [2019-09-08 12:45:51,456 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4998 transitions. Word has length 139 [2019-09-08 12:45:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:51,457 INFO L475 AbstractCegarLoop]: Abstraction has 3386 states and 4998 transitions. [2019-09-08 12:45:51,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4998 transitions. [2019-09-08 12:45:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:51,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:51,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:51,460 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:51,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash 34945767, now seen corresponding path program 1 times [2019-09-08 12:45:51,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:51,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:51,570 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 12:45:51,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:51,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:51,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:51,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:51,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:51,571 INFO L87 Difference]: Start difference. First operand 3386 states and 4998 transitions. Second operand 3 states. [2019-09-08 12:45:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:52,014 INFO L93 Difference]: Finished difference Result 6462 states and 9568 transitions. [2019-09-08 12:45:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:52,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 12:45:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:52,033 INFO L225 Difference]: With dead ends: 6462 [2019-09-08 12:45:52,033 INFO L226 Difference]: Without dead ends: 3388 [2019-09-08 12:45:52,041 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 12:45:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-09-08 12:45:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3386. [2019-09-08 12:45:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-09-08 12:45:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4990 transitions. [2019-09-08 12:45:52,589 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4990 transitions. Word has length 139 [2019-09-08 12:45:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:52,590 INFO L475 AbstractCegarLoop]: Abstraction has 3386 states and 4990 transitions. [2019-09-08 12:45:52,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4990 transitions. [2019-09-08 12:45:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:52,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:52,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:52,593 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash 878292919, now seen corresponding path program 1 times [2019-09-08 12:45:52,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:52,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:52,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:52,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:52,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:52,738 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 12:45:52,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:52,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:52,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:52,740 INFO L87 Difference]: Start difference. First operand 3386 states and 4990 transitions. Second operand 5 states. [2019-09-08 12:45:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:53,384 INFO L93 Difference]: Finished difference Result 6572 states and 9711 transitions. [2019-09-08 12:45:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:53,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 12:45:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:53,423 INFO L225 Difference]: With dead ends: 6572 [2019-09-08 12:45:53,424 INFO L226 Difference]: Without dead ends: 4184 [2019-09-08 12:45:53,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:45:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2019-09-08 12:45:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3740. [2019-09-08 12:45:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3740 states. [2019-09-08 12:45:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5516 transitions. [2019-09-08 12:45:53,971 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5516 transitions. Word has length 139 [2019-09-08 12:45:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:53,972 INFO L475 AbstractCegarLoop]: Abstraction has 3740 states and 5516 transitions. [2019-09-08 12:45:53,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5516 transitions. [2019-09-08 12:45:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:53,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:53,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:53,975 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:53,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1642320824, now seen corresponding path program 1 times [2019-09-08 12:45:53,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:53,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:53,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:54,110 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 12:45:54,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:54,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:54,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:54,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:54,112 INFO L87 Difference]: Start difference. First operand 3740 states and 5516 transitions. Second operand 5 states. [2019-09-08 12:45:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:54,777 INFO L93 Difference]: Finished difference Result 7418 states and 10973 transitions. [2019-09-08 12:45:54,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:54,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 12:45:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:54,788 INFO L225 Difference]: With dead ends: 7418 [2019-09-08 12:45:54,789 INFO L226 Difference]: Without dead ends: 4688 [2019-09-08 12:45:54,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:45:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4688 states. [2019-09-08 12:45:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4688 to 4124. [2019-09-08 12:45:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2019-09-08 12:45:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 6090 transitions. [2019-09-08 12:45:55,214 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 6090 transitions. Word has length 139 [2019-09-08 12:45:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:55,214 INFO L475 AbstractCegarLoop]: Abstraction has 4124 states and 6090 transitions. [2019-09-08 12:45:55,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 6090 transitions. [2019-09-08 12:45:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:45:55,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:55,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:55,217 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:55,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash 884469899, now seen corresponding path program 1 times [2019-09-08 12:45:55,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:55,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:55,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:55,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:55,355 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 12:45:55,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:55,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:55,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:55,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:55,358 INFO L87 Difference]: Start difference. First operand 4124 states and 6090 transitions. Second operand 5 states. [2019-09-08 12:45:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:56,326 INFO L93 Difference]: Finished difference Result 11298 states and 16742 transitions. [2019-09-08 12:45:56,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:56,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 12:45:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:56,346 INFO L225 Difference]: With dead ends: 11298 [2019-09-08 12:45:56,346 INFO L226 Difference]: Without dead ends: 8226 [2019-09-08 12:45:56,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:45:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-09-08 12:45:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 7964. [2019-09-08 12:45:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7964 states. [2019-09-08 12:45:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7964 states to 7964 states and 11798 transitions. [2019-09-08 12:45:57,278 INFO L78 Accepts]: Start accepts. Automaton has 7964 states and 11798 transitions. Word has length 139 [2019-09-08 12:45:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:57,278 INFO L475 AbstractCegarLoop]: Abstraction has 7964 states and 11798 transitions. [2019-09-08 12:45:57,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7964 states and 11798 transitions. [2019-09-08 12:45:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:45:57,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:57,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:57,282 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:57,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:57,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1339516528, now seen corresponding path program 1 times [2019-09-08 12:45:57,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:57,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:57,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:57,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:57,442 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 12:45:57,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:57,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:45:57,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:45:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:45:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:45:57,444 INFO L87 Difference]: Start difference. First operand 7964 states and 11798 transitions. Second operand 4 states. [2019-09-08 12:45:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:58,516 INFO L93 Difference]: Finished difference Result 19049 states and 28258 transitions. [2019-09-08 12:45:58,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:45:58,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 12:45:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:58,549 INFO L225 Difference]: With dead ends: 19049 [2019-09-08 12:45:58,549 INFO L226 Difference]: Without dead ends: 11535 [2019-09-08 12:45:58,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:45:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11535 states. [2019-09-08 12:46:00,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11535 to 11533. [2019-09-08 12:46:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11533 states. [2019-09-08 12:46:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11533 states to 11533 states and 17057 transitions. [2019-09-08 12:46:00,299 INFO L78 Accepts]: Start accepts. Automaton has 11533 states and 17057 transitions. Word has length 140 [2019-09-08 12:46:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:00,300 INFO L475 AbstractCegarLoop]: Abstraction has 11533 states and 17057 transitions. [2019-09-08 12:46:00,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:46:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 11533 states and 17057 transitions. [2019-09-08 12:46:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:46:00,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:00,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:00,304 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1081409652, now seen corresponding path program 1 times [2019-09-08 12:46:00,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:00,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:00,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:00,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:00,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:00,426 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 12:46:00,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:00,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:46:00,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:46:00,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:46:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:46:00,428 INFO L87 Difference]: Start difference. First operand 11533 states and 17057 transitions. Second operand 5 states. [2019-09-08 12:46:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:02,289 INFO L93 Difference]: Finished difference Result 19233 states and 28382 transitions. [2019-09-08 12:46:02,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:46:02,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-09-08 12:46:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:02,322 INFO L225 Difference]: With dead ends: 19233 [2019-09-08 12:46:02,322 INFO L226 Difference]: Without dead ends: 19231 [2019-09-08 12:46:02,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:46:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19231 states. [2019-09-08 12:46:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19231 to 11597. [2019-09-08 12:46:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-08 12:46:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17105 transitions. [2019-09-08 12:46:03,720 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17105 transitions. Word has length 140 [2019-09-08 12:46:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:03,721 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17105 transitions. [2019-09-08 12:46:03,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:46:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17105 transitions. [2019-09-08 12:46:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:46:03,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:03,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:03,724 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:03,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1469081280, now seen corresponding path program 1 times [2019-09-08 12:46:03,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:03,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:03,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:03,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:03,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:04,041 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 12:46:04,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:04,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:46:04,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:46:04,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:46:04,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:46:04,043 INFO L87 Difference]: Start difference. First operand 11597 states and 17105 transitions. Second operand 10 states. [2019-09-08 12:46:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:07,921 INFO L93 Difference]: Finished difference Result 34510 states and 50814 transitions. [2019-09-08 12:46:07,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:46:07,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2019-09-08 12:46:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:07,956 INFO L225 Difference]: With dead ends: 34510 [2019-09-08 12:46:07,956 INFO L226 Difference]: Without dead ends: 23138 [2019-09-08 12:46:07,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:46:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23138 states. [2019-09-08 12:46:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23138 to 11597. [2019-09-08 12:46:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-08 12:46:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17102 transitions. [2019-09-08 12:46:10,154 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17102 transitions. Word has length 141 [2019-09-08 12:46:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:10,154 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17102 transitions. [2019-09-08 12:46:10,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:46:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17102 transitions. [2019-09-08 12:46:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:46:10,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:10,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:10,157 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1896763478, now seen corresponding path program 1 times [2019-09-08 12:46:10,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:10,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:10,452 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 12:46:10,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:10,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:46:10,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:46:10,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:46:10,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:46:10,453 INFO L87 Difference]: Start difference. First operand 11597 states and 17102 transitions. Second operand 10 states. [2019-09-08 12:46:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:14,308 INFO L93 Difference]: Finished difference Result 34615 states and 51004 transitions. [2019-09-08 12:46:14,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:46:14,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2019-09-08 12:46:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:14,339 INFO L225 Difference]: With dead ends: 34615 [2019-09-08 12:46:14,339 INFO L226 Difference]: Without dead ends: 23231 [2019-09-08 12:46:14,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23231 states. [2019-09-08 12:46:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23231 to 11597. [2019-09-08 12:46:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-08 12:46:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17096 transitions. [2019-09-08 12:46:15,928 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17096 transitions. Word has length 141 [2019-09-08 12:46:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:15,929 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17096 transitions. [2019-09-08 12:46:15,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:46:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17096 transitions. [2019-09-08 12:46:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:46:15,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:15,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:15,932 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1860895276, now seen corresponding path program 1 times [2019-09-08 12:46:15,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:15,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:15,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:15,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:15,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:16,178 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 12:46:16,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:16,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:16,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:16,181 INFO L87 Difference]: Start difference. First operand 11597 states and 17096 transitions. Second operand 9 states. [2019-09-08 12:46:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:19,760 INFO L93 Difference]: Finished difference Result 32214 states and 47549 transitions. [2019-09-08 12:46:19,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:46:19,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-09-08 12:46:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:19,782 INFO L225 Difference]: With dead ends: 32214 [2019-09-08 12:46:19,783 INFO L226 Difference]: Without dead ends: 22744 [2019-09-08 12:46:19,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:46:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22744 states. [2019-09-08 12:46:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22744 to 11597. [2019-09-08 12:46:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-08 12:46:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17095 transitions. [2019-09-08 12:46:21,877 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17095 transitions. Word has length 141 [2019-09-08 12:46:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:21,877 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17095 transitions. [2019-09-08 12:46:21,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17095 transitions. [2019-09-08 12:46:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:46:21,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:21,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:21,880 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2088796575, now seen corresponding path program 1 times [2019-09-08 12:46:21,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:21,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:22,129 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 12:46:22,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:22,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:46:22,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:46:22,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:46:22,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:46:22,131 INFO L87 Difference]: Start difference. First operand 11597 states and 17095 transitions. Second operand 10 states. [2019-09-08 12:46:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:26,258 INFO L93 Difference]: Finished difference Result 34517 states and 50839 transitions. [2019-09-08 12:46:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:46:26,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-09-08 12:46:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:26,283 INFO L225 Difference]: With dead ends: 34517 [2019-09-08 12:46:26,283 INFO L226 Difference]: Without dead ends: 23213 [2019-09-08 12:46:26,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23213 states. [2019-09-08 12:46:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23213 to 11597. [2019-09-08 12:46:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-08 12:46:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17082 transitions. [2019-09-08 12:46:27,949 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17082 transitions. Word has length 142 [2019-09-08 12:46:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:27,949 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17082 transitions. [2019-09-08 12:46:27,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:46:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17082 transitions. [2019-09-08 12:46:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 12:46:27,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:27,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:27,952 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:27,952 INFO L82 PathProgramCache]: Analyzing trace with hash 564881863, now seen corresponding path program 1 times [2019-09-08 12:46:27,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:27,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:27,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:27,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:27,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:28,215 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 12:46:28,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:28,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:46:28,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:46:28,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:46:28,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:46:28,217 INFO L87 Difference]: Start difference. First operand 11597 states and 17082 transitions. Second operand 10 states. [2019-09-08 12:46:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:32,729 INFO L93 Difference]: Finished difference Result 34597 states and 50934 transitions. [2019-09-08 12:46:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:46:32,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2019-09-08 12:46:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:32,753 INFO L225 Difference]: With dead ends: 34597 [2019-09-08 12:46:32,753 INFO L226 Difference]: Without dead ends: 23243 [2019-09-08 12:46:32,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23243 states. [2019-09-08 12:46:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23243 to 11597. [2019-09-08 12:46:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-08 12:46:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17072 transitions. [2019-09-08 12:46:34,512 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17072 transitions. Word has length 143 [2019-09-08 12:46:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:34,512 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17072 transitions. [2019-09-08 12:46:34,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:46:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17072 transitions. [2019-09-08 12:46:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:46:34,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:34,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:34,515 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:34,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:34,515 INFO L82 PathProgramCache]: Analyzing trace with hash 256129908, now seen corresponding path program 1 times [2019-09-08 12:46:34,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:34,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:34,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:34,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:34,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:34,777 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 12:46:34,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:34,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:46:34,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:46:34,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:46:34,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:46:34,778 INFO L87 Difference]: Start difference. First operand 11597 states and 17072 transitions. Second operand 10 states. [2019-09-08 12:46:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:39,504 INFO L93 Difference]: Finished difference Result 34402 states and 50632 transitions. [2019-09-08 12:46:39,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:46:39,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2019-09-08 12:46:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:39,528 INFO L225 Difference]: With dead ends: 34402 [2019-09-08 12:46:39,529 INFO L226 Difference]: Without dead ends: 23163 [2019-09-08 12:46:39,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23163 states. [2019-09-08 12:46:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23163 to 11597. [2019-09-08 12:46:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-08 12:46:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17057 transitions. [2019-09-08 12:46:41,371 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17057 transitions. Word has length 144 [2019-09-08 12:46:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:41,371 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17057 transitions. [2019-09-08 12:46:41,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:46:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17057 transitions. [2019-09-08 12:46:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 12:46:41,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:41,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:41,374 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash 86948800, now seen corresponding path program 1 times [2019-09-08 12:46:41,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:41,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:41,628 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 12:46:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:41,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:46:41,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:46:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:46:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:46:41,630 INFO L87 Difference]: Start difference. First operand 11597 states and 17057 transitions. Second operand 10 states. [2019-09-08 12:46:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:46,585 INFO L93 Difference]: Finished difference Result 34262 states and 50393 transitions. [2019-09-08 12:46:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:46:46,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2019-09-08 12:46:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:46,610 INFO L225 Difference]: With dead ends: 34262 [2019-09-08 12:46:46,611 INFO L226 Difference]: Without dead ends: 23098 [2019-09-08 12:46:46,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23098 states. [2019-09-08 12:46:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23098 to 11597. [2019-09-08 12:46:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-08 12:46:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17040 transitions. [2019-09-08 12:46:48,741 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17040 transitions. Word has length 145 [2019-09-08 12:46:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:48,742 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17040 transitions. [2019-09-08 12:46:48,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:46:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17040 transitions. [2019-09-08 12:46:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:46:48,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:48,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:48,744 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:48,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash 27281514, now seen corresponding path program 1 times [2019-09-08 12:46:48,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:48,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:48,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:48,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:48,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:49,013 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 12:46:49,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:49,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:46:49,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:46:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:46:49,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:46:49,015 INFO L87 Difference]: Start difference. First operand 11597 states and 17040 transitions. Second operand 10 states. [2019-09-08 12:46:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:58,344 INFO L93 Difference]: Finished difference Result 54918 states and 80411 transitions. [2019-09-08 12:46:58,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:46:58,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2019-09-08 12:46:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:58,389 INFO L225 Difference]: With dead ends: 54918 [2019-09-08 12:46:58,390 INFO L226 Difference]: Without dead ends: 43771 [2019-09-08 12:46:58,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:46:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43771 states. [2019-09-08 12:47:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43771 to 11654. [2019-09-08 12:47:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-09-08 12:47:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 17116 transitions. [2019-09-08 12:47:01,450 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 17116 transitions. Word has length 146 [2019-09-08 12:47:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:01,450 INFO L475 AbstractCegarLoop]: Abstraction has 11654 states and 17116 transitions. [2019-09-08 12:47:01,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:47:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 17116 transitions. [2019-09-08 12:47:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:47:01,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:01,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:47:01,453 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:01,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:01,453 INFO L82 PathProgramCache]: Analyzing trace with hash -612151363, now seen corresponding path program 1 times [2019-09-08 12:47:01,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:01,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:01,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:02,313 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:47:03,035 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 12:47:03,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:03,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 12:47:03,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 12:47:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 12:47:03,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:47:03,037 INFO L87 Difference]: Start difference. First operand 11654 states and 17116 transitions. Second operand 23 states. [2019-09-08 12:47:04,213 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:47:04,434 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-08 12:47:04,816 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-08 12:47:05,170 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-08 12:47:05,665 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 99 [2019-09-08 12:47:05,865 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 12:47:06,084 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 12:47:06,273 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 12:47:06,553 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:47:06,843 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:47:07,179 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:47:07,421 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:47:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:18,411 INFO L93 Difference]: Finished difference Result 52938 states and 77996 transitions. [2019-09-08 12:47:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:47:18,411 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 147 [2019-09-08 12:47:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:18,456 INFO L225 Difference]: With dead ends: 52938 [2019-09-08 12:47:18,456 INFO L226 Difference]: Without dead ends: 43462 [2019-09-08 12:47:18,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:47:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43462 states. [2019-09-08 12:47:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43462 to 11659. [2019-09-08 12:47:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11659 states. [2019-09-08 12:47:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11659 states to 11659 states and 17119 transitions. [2019-09-08 12:47:21,276 INFO L78 Accepts]: Start accepts. Automaton has 11659 states and 17119 transitions. Word has length 147 [2019-09-08 12:47:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:21,276 INFO L475 AbstractCegarLoop]: Abstraction has 11659 states and 17119 transitions. [2019-09-08 12:47:21,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 12:47:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 11659 states and 17119 transitions. [2019-09-08 12:47:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:47:21,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:21,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:47:21,279 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:21,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:21,279 INFO L82 PathProgramCache]: Analyzing trace with hash 784796829, now seen corresponding path program 1 times [2019-09-08 12:47:21,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:21,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:21,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:21,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:21,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:22,259 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:47:22,509 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-09-08 12:47:23,087 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 12:47:23,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:23,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:47:23,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:47:23,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:47:23,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:47:23,088 INFO L87 Difference]: Start difference. First operand 11659 states and 17119 transitions. Second operand 25 states. [2019-09-08 12:47:24,236 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 12:47:24,494 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-08 12:47:24,855 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-08 12:47:25,259 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-09-08 12:47:25,766 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 112 [2019-09-08 12:47:26,296 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2019-09-08 12:47:26,525 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 12:47:26,986 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-08 12:47:27,406 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:47:27,656 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:47:28,006 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:47:28,502 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 12:47:28,921 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 12:47:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:47,767 INFO L93 Difference]: Finished difference Result 75592 states and 111450 transitions. [2019-09-08 12:47:47,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:47:47,768 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147 [2019-09-08 12:47:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:47,845 INFO L225 Difference]: With dead ends: 75592 [2019-09-08 12:47:47,845 INFO L226 Difference]: Without dead ends: 65332 [2019-09-08 12:47:47,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:47:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65332 states. [2019-09-08 12:47:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65332 to 11704. [2019-09-08 12:47:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11704 states. [2019-09-08 12:47:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11704 states to 11704 states and 17170 transitions. [2019-09-08 12:47:51,350 INFO L78 Accepts]: Start accepts. Automaton has 11704 states and 17170 transitions. Word has length 147 [2019-09-08 12:47:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:51,350 INFO L475 AbstractCegarLoop]: Abstraction has 11704 states and 17170 transitions. [2019-09-08 12:47:51,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:47:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 11704 states and 17170 transitions. [2019-09-08 12:47:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:47:51,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:51,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:47:51,352 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:51,353 INFO L82 PathProgramCache]: Analyzing trace with hash 711494045, now seen corresponding path program 1 times [2019-09-08 12:47:51,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:51,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:51,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:51,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:51,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:52,413 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-08 12:47:52,588 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-08 12:47:52,776 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-08 12:47:52,981 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:47:53,204 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-08 12:47:53,406 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-09-08 12:47:53,656 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-08 12:47:53,894 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-08 12:47:54,176 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-08 12:47:54,422 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-08 12:47:54,732 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-08 12:47:54,982 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-09-08 12:47:55,276 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-08 12:47:55,518 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-08 12:47:55,783 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-08 12:47:56,016 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-08 12:47:56,259 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-08 12:47:59,117 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 12:47:59,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:59,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2019-09-08 12:47:59,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 12:47:59,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 12:47:59,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 12:47:59,120 INFO L87 Difference]: Start difference. First operand 11704 states and 17170 transitions. Second operand 48 states. [2019-09-08 12:47:59,441 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-09-08 12:48:01,113 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-08 12:48:01,351 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-08 12:48:01,599 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-08 12:48:01,904 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-09-08 12:48:02,197 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2019-09-08 12:48:02,508 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-09-08 12:48:03,927 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-09-08 12:48:04,405 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-09-08 12:48:04,882 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 87 [2019-09-08 12:48:05,508 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 102 [2019-09-08 12:48:06,170 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 111 [2019-09-08 12:48:07,014 WARN L188 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 133 [2019-09-08 12:48:07,968 WARN L188 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 148 [2019-09-08 12:48:09,120 WARN L188 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 170 [2019-09-08 12:48:10,385 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 245 DAG size of output: 185 [2019-09-08 12:48:11,899 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 270 DAG size of output: 207 [2019-09-08 12:48:13,418 WARN L188 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 288 DAG size of output: 221 [2019-09-08 12:48:15,297 WARN L188 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 315 DAG size of output: 240 [2019-09-08 12:48:17,354 WARN L188 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 338 DAG size of output: 261 [2019-09-08 12:48:19,736 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 360 DAG size of output: 280 [2019-09-08 12:48:20,315 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 107 [2019-09-08 12:48:20,857 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 107 [2019-09-08 12:48:21,181 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-08 12:48:21,726 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 104 [2019-09-08 12:48:21,986 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-08 12:48:22,247 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-08 12:48:22,762 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 104 [2019-09-08 12:48:23,321 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-08 12:48:23,889 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2019-09-08 12:48:24,313 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-08 12:48:24,814 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2019-09-08 12:48:25,645 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-08 12:48:26,193 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-08 12:48:26,992 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-09-08 12:48:27,612 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-09-08 12:48:28,416 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 12:48:28,946 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 12:48:32,441 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-09-08 12:49:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:02,472 INFO L93 Difference]: Finished difference Result 66070 states and 96861 transitions. [2019-09-08 12:49:02,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 12:49:02,472 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2019-09-08 12:49:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:02,534 INFO L225 Difference]: With dead ends: 66070 [2019-09-08 12:49:02,534 INFO L226 Difference]: Without dead ends: 57523 [2019-09-08 12:49:02,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=1460, Invalid=7660, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 12:49:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57523 states. [2019-09-08 12:49:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57523 to 11858. [2019-09-08 12:49:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11858 states. [2019-09-08 12:49:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11858 states to 11858 states and 17380 transitions. [2019-09-08 12:49:06,781 INFO L78 Accepts]: Start accepts. Automaton has 11858 states and 17380 transitions. Word has length 147 [2019-09-08 12:49:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:06,781 INFO L475 AbstractCegarLoop]: Abstraction has 11858 states and 17380 transitions. [2019-09-08 12:49:06,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 12:49:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 11858 states and 17380 transitions. [2019-09-08 12:49:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:49:06,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:06,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:06,783 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:06,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:06,784 INFO L82 PathProgramCache]: Analyzing trace with hash -214493605, now seen corresponding path program 1 times [2019-09-08 12:49:06,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:06,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:06,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:08,120 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-08 12:49:08,257 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-08 12:49:08,412 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 12:49:08,585 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:49:08,811 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-08 12:49:09,059 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-08 12:49:09,381 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-08 12:49:09,847 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 12:49:10,118 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-08 12:49:10,390 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-09-08 12:49:10,635 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-08 12:49:10,972 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-09-08 12:49:13,256 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-08 12:49:17,570 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-08 12:49:17,819 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 12:49:20,598 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 12:49:20,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:20,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2019-09-08 12:49:20,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 12:49:20,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 12:49:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2138, Unknown=2, NotChecked=0, Total=2256 [2019-09-08 12:49:20,601 INFO L87 Difference]: Start difference. First operand 11858 states and 17380 transitions. Second operand 48 states. [2019-09-08 12:49:20,983 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-09-08 12:49:22,906 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-08 12:49:23,160 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-08 12:49:23,465 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-09-08 12:49:23,778 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-09-08 12:49:25,379 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-09-08 12:49:25,979 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2019-09-08 12:49:26,579 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-09-08 12:49:27,498 WARN L188 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 134 [2019-09-08 12:49:29,550 WARN L188 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 199 DAG size of output: 158 [2019-09-08 12:49:32,941 WARN L188 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 225 DAG size of output: 182 [2019-09-08 12:49:34,657 WARN L188 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 252 DAG size of output: 208 [2019-09-08 12:49:36,683 WARN L188 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 282 DAG size of output: 236 [2019-09-08 12:49:39,467 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 311 DAG size of output: 263 [2019-09-08 12:49:42,495 WARN L188 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 329 DAG size of output: 273 [2019-09-08 12:49:49,984 WARN L188 SmtUtils]: Spent 7.22 s on a formula simplification. DAG size of input: 351 DAG size of output: 292 [2019-09-08 12:50:08,692 WARN L188 SmtUtils]: Spent 18.37 s on a formula simplification. DAG size of input: 380 DAG size of output: 318 [2019-09-08 12:50:40,882 WARN L188 SmtUtils]: Spent 31.90 s on a formula simplification. DAG size of input: 407 DAG size of output: 342 [2019-09-08 12:51:07,205 WARN L188 SmtUtils]: Spent 25.97 s on a formula simplification. DAG size of input: 427 DAG size of output: 361 [2019-09-08 12:51:07,838 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 110 [2019-09-08 12:51:08,411 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 110 [2019-09-08 12:51:08,953 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-09-08 12:51:09,353 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-09-08 12:51:09,710 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-09-08 12:51:10,239 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-08 12:51:11,146 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-08 12:51:19,074 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2019-09-08 12:51:20,116 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2019-09-08 12:52:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:09,185 INFO L93 Difference]: Finished difference Result 78922 states and 115944 transitions. [2019-09-08 12:52:09,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 12:52:09,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2019-09-08 12:52:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:09,258 INFO L225 Difference]: With dead ends: 78922 [2019-09-08 12:52:09,258 INFO L226 Difference]: Without dead ends: 70375 [2019-09-08 12:52:09,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 120.6s TimeCoverageRelationStatistics Valid=1351, Invalid=8547, Unknown=2, NotChecked=0, Total=9900 [2019-09-08 12:52:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70375 states. [2019-09-08 12:52:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70375 to 11878. [2019-09-08 12:52:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-09-08 12:52:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 17406 transitions. [2019-09-08 12:52:14,223 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 17406 transitions. Word has length 147 [2019-09-08 12:52:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:14,223 INFO L475 AbstractCegarLoop]: Abstraction has 11878 states and 17406 transitions. [2019-09-08 12:52:14,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 12:52:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 17406 transitions. [2019-09-08 12:52:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:52:14,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:14,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:14,226 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:14,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:14,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1641428251, now seen corresponding path program 1 times [2019-09-08 12:52:14,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:14,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:14,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:14,317 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 12:52:14,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:14,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:52:14,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:52:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:52:14,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:52:14,319 INFO L87 Difference]: Start difference. First operand 11878 states and 17406 transitions. Second operand 3 states. [2019-09-08 12:52:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:23,573 INFO L93 Difference]: Finished difference Result 33648 states and 49671 transitions. [2019-09-08 12:52:23,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:52:23,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-08 12:52:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:23,595 INFO L225 Difference]: With dead ends: 33648 [2019-09-08 12:52:23,596 INFO L226 Difference]: Without dead ends: 22501 [2019-09-08 12:52:23,606 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 12:52:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22501 states. [2019-09-08 12:52:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22501 to 21975. [2019-09-08 12:52:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21975 states. [2019-09-08 12:52:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21975 states to 21975 states and 32134 transitions. [2019-09-08 12:52:31,988 INFO L78 Accepts]: Start accepts. Automaton has 21975 states and 32134 transitions. Word has length 147 [2019-09-08 12:52:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:31,988 INFO L475 AbstractCegarLoop]: Abstraction has 21975 states and 32134 transitions. [2019-09-08 12:52:31,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:52:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 21975 states and 32134 transitions. [2019-09-08 12:52:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:52:31,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:31,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:31,990 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash 706801083, now seen corresponding path program 1 times [2019-09-08 12:52:31,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:31,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:31,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:31,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:31,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:33,072 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 12:52:33,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:33,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:52:33,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:52:33,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:52:33,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:52:33,073 INFO L87 Difference]: Start difference. First operand 21975 states and 32134 transitions. Second operand 19 states. [2019-09-08 12:52:33,867 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-08 12:52:34,084 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-08 12:52:34,389 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-08 12:52:34,726 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-09-08 12:52:34,919 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:52:35,379 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:52:35,718 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:52:35,893 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:52:36,188 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:53:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:28,002 INFO L93 Difference]: Finished difference Result 142799 states and 209587 transitions. [2019-09-08 12:53:28,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:53:28,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 147 [2019-09-08 12:53:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:28,134 INFO L225 Difference]: With dead ends: 142799 [2019-09-08 12:53:28,134 INFO L226 Difference]: Without dead ends: 123302 [2019-09-08 12:53:28,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:53:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123302 states. [2019-09-08 12:53:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123302 to 22000. [2019-09-08 12:53:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22000 states. [2019-09-08 12:53:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22000 states to 22000 states and 32151 transitions. [2019-09-08 12:53:38,467 INFO L78 Accepts]: Start accepts. Automaton has 22000 states and 32151 transitions. Word has length 147 [2019-09-08 12:53:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:38,468 INFO L475 AbstractCegarLoop]: Abstraction has 22000 states and 32151 transitions. [2019-09-08 12:53:38,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:53:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 22000 states and 32151 transitions. [2019-09-08 12:53:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:53:38,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:38,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:38,469 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:38,470 INFO L82 PathProgramCache]: Analyzing trace with hash -263001346, now seen corresponding path program 1 times [2019-09-08 12:53:38,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:38,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:38,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:39,619 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:53:39,791 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 12:53:40,100 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:53:40,411 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-08 12:53:41,515 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 12:53:41,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:41,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:53:41,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:53:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:53:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:53:41,516 INFO L87 Difference]: Start difference. First operand 22000 states and 32151 transitions. Second operand 31 states. [2019-09-08 12:53:42,853 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-09-08 12:53:43,509 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-09-08 12:53:43,827 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-08 12:53:44,259 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-09-08 12:53:44,738 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2019-09-08 12:53:45,366 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 122 [2019-09-08 12:53:46,054 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 135 [2019-09-08 12:53:46,980 WARN L188 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 165 [2019-09-08 12:53:47,956 WARN L188 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 180 [2019-09-08 12:53:48,269 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-08 12:53:48,492 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-08 12:53:48,989 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-09-08 12:53:49,592 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-09-08 12:53:49,881 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-08 12:53:50,373 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-08 12:53:51,042 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-08 12:53:51,684 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-08 12:53:52,473 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-08 12:53:53,057 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-08 12:54:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:55,215 INFO L93 Difference]: Finished difference Result 143246 states and 210142 transitions. [2019-09-08 12:54:55,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 12:54:55,215 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2019-09-08 12:54:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:55,383 INFO L225 Difference]: With dead ends: 143246 [2019-09-08 12:54:55,383 INFO L226 Difference]: Without dead ends: 123693 [2019-09-08 12:54:55,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 12:54:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123693 states. [2019-09-08 12:55:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123693 to 21979. [2019-09-08 12:55:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21979 states. [2019-09-08 12:55:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21979 states to 21979 states and 32119 transitions. [2019-09-08 12:55:06,821 INFO L78 Accepts]: Start accepts. Automaton has 21979 states and 32119 transitions. Word has length 147 [2019-09-08 12:55:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:06,821 INFO L475 AbstractCegarLoop]: Abstraction has 21979 states and 32119 transitions. [2019-09-08 12:55:06,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:55:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21979 states and 32119 transitions. [2019-09-08 12:55:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:55:06,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:06,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:06,823 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash 380395743, now seen corresponding path program 1 times [2019-09-08 12:55:06,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:08,473 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 12:55:08,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:55:08,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:55:08,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:55:08,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:55:08,474 INFO L87 Difference]: Start difference. First operand 21979 states and 32119 transitions. Second operand 24 states. [2019-09-08 12:55:09,547 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-08 12:55:09,811 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-08 12:55:10,087 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 12:55:10,448 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-08 12:55:10,895 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-09-08 12:55:11,401 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2019-09-08 12:55:11,653 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-09-08 12:55:11,905 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-09-08 12:55:12,209 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-08 12:55:12,524 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-08 12:55:12,699 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-08 12:55:12,900 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 12:55:13,290 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-08 12:55:13,934 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-08 12:55:14,220 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:55:14,799 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:56:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:12,171 INFO L93 Difference]: Finished difference Result 128277 states and 188125 transitions. [2019-09-08 12:56:12,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:56:12,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 147 [2019-09-08 12:56:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:12,305 INFO L225 Difference]: With dead ends: 128277 [2019-09-08 12:56:12,305 INFO L226 Difference]: Without dead ends: 111985 [2019-09-08 12:56:12,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=528, Invalid=2022, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:56:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111985 states. [2019-09-08 12:56:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111985 to 22016. [2019-09-08 12:56:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22016 states. [2019-09-08 12:56:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22016 states to 22016 states and 32167 transitions. [2019-09-08 12:56:24,387 INFO L78 Accepts]: Start accepts. Automaton has 22016 states and 32167 transitions. Word has length 147 [2019-09-08 12:56:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:24,387 INFO L475 AbstractCegarLoop]: Abstraction has 22016 states and 32167 transitions. [2019-09-08 12:56:24,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:56:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 22016 states and 32167 transitions. [2019-09-08 12:56:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:56:24,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:24,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:24,390 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:24,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1588029789, now seen corresponding path program 1 times [2019-09-08 12:56:24,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:24,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:24,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:24,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:24,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:25,327 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:56:26,162 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 12:56:26,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:26,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:56:26,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:56:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:56:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:56:26,164 INFO L87 Difference]: Start difference. First operand 22016 states and 32167 transitions. Second operand 25 states. [2019-09-08 12:56:27,334 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:56:27,597 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:56:27,945 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-08 12:56:28,327 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-08 12:56:28,814 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-09-08 12:56:29,386 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2019-09-08 12:56:29,635 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-08 12:56:29,804 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-08 12:56:30,156 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 12:56:30,537 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:56:30,852 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:56:31,190 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:57:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:12,649 INFO L93 Difference]: Finished difference Result 84539 states and 123849 transitions. [2019-09-08 12:57:12,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 12:57:12,649 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147 [2019-09-08 12:57:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:12,723 INFO L225 Difference]: With dead ends: 84539 [2019-09-08 12:57:12,723 INFO L226 Difference]: Without dead ends: 73699 [2019-09-08 12:57:12,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=437, Invalid=1915, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 12:57:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73699 states. [2019-09-08 12:57:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73699 to 21981. [2019-09-08 12:57:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-09-08 12:57:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 32115 transitions. [2019-09-08 12:57:26,347 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 32115 transitions. Word has length 147 [2019-09-08 12:57:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:26,347 INFO L475 AbstractCegarLoop]: Abstraction has 21981 states and 32115 transitions. [2019-09-08 12:57:26,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:57:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 32115 transitions. [2019-09-08 12:57:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 12:57:26,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:26,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:26,349 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:26,350 INFO L82 PathProgramCache]: Analyzing trace with hash -405164467, now seen corresponding path program 1 times [2019-09-08 12:57:26,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:26,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:26,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:26,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:26,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:27,246 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 12:57:27,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:27,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:57:27,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:57:27,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:57:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:57:27,247 INFO L87 Difference]: Start difference. First operand 21981 states and 32115 transitions. Second operand 17 states. [2019-09-08 12:57:28,011 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-08 12:57:28,249 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-09-08 12:57:28,402 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 12:57:28,566 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 12:57:28,703 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:57:29,091 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 12:58:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:18,373 INFO L93 Difference]: Finished difference Result 103984 states and 152564 transitions. [2019-09-08 12:58:18,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:58:18,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2019-09-08 12:58:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:18,466 INFO L225 Difference]: With dead ends: 103984 [2019-09-08 12:58:18,467 INFO L226 Difference]: Without dead ends: 85956 [2019-09-08 12:58:18,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:58:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85956 states. [2019-09-08 12:58:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85956 to 21941. [2019-09-08 12:58:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21941 states. [2019-09-08 12:58:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21941 states to 21941 states and 32063 transitions. [2019-09-08 12:58:31,663 INFO L78 Accepts]: Start accepts. Automaton has 21941 states and 32063 transitions. Word has length 148 [2019-09-08 12:58:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:31,663 INFO L475 AbstractCegarLoop]: Abstraction has 21941 states and 32063 transitions. [2019-09-08 12:58:31,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:58:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 21941 states and 32063 transitions. [2019-09-08 12:58:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 12:58:31,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:31,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:31,665 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:31,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1220357330, now seen corresponding path program 1 times [2019-09-08 12:58:31,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:31,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:31,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:31,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:31,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:32,694 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 12:58:32,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:32,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:58:32,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:58:32,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:58:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:58:32,695 INFO L87 Difference]: Start difference. First operand 21941 states and 32063 transitions. Second operand 19 states. [2019-09-08 12:58:33,505 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-08 12:58:33,739 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-08 12:58:34,069 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-08 12:58:34,422 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-09-08 12:58:34,620 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:58:34,828 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 12:58:35,199 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:58:35,649 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:58:35,847 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:58:36,387 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:59:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:19,322 INFO L93 Difference]: Finished difference Result 90466 states and 132597 transitions. [2019-09-08 12:59:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:59:19,322 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 148 [2019-09-08 12:59:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:19,398 INFO L225 Difference]: With dead ends: 90466 [2019-09-08 12:59:19,398 INFO L226 Difference]: Without dead ends: 71016 [2019-09-08 12:59:19,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:59:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71016 states.