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/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:08:21,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:08:21,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:08:21,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:08:21,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:08:21,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:08:21,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:08:21,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:08:21,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:08:21,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:08:21,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:08:21,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:08:21,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:08:21,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:08:21,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:08:21,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:08:21,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:08:21,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:08:21,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:08:21,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:08:21,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:08:21,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:08:21,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:08:21,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:08:21,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:08:21,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:08:21,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:08:21,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:08:21,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:08:21,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:08:21,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:08:21,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:08:21,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:08:21,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:08:21,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:08:21,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:08:21,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:08:21,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:08:21,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:08:21,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:08:21,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:08:21,099 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 07:08:21,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:08:21,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:08:21,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:08:21,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:08:21,129 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:08:21,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:08:21,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:08:21,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:08:21,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:08:21,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:08:21,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:08:21,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:08:21,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:08:21,132 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:08:21,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:08:21,132 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:08:21,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:08:21,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:08:21,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:08:21,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:08:21,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:08:21,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:08:21,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:08:21,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:08:21,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:08:21,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:08:21,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:08:21,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:08:21,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:08:21,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:08:21,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:08:21,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:08:21,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:08:21,190 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:08:21,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:08:21,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a784b83f/020639a0f96049589d549bad82e93d60/FLAGaf655118b [2019-09-08 07:08:21,844 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:08:21,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:08:21,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a784b83f/020639a0f96049589d549bad82e93d60/FLAGaf655118b [2019-09-08 07:08:22,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a784b83f/020639a0f96049589d549bad82e93d60 [2019-09-08 07:08:22,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:08:22,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:08:22,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:08:22,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:08:22,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:08:22,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e80282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22, skipping insertion in model container [2019-09-08 07:08:22,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,144 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:08:22,191 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:08:22,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:08:22,573 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:08:22,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:08:22,685 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:08:22,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22 WrapperNode [2019-09-08 07:08:22,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:08:22,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:08:22,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:08:22,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:08:22,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (1/1) ... [2019-09-08 07:08:22,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:08:22,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:08:22,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:08:22,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:08:22,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (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 07:08:22,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:08:22,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:08:22,820 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:08:22,820 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:08:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:08:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:08:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:08:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:08:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:08:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:08:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:08:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:08:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:08:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:08:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:08:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:08:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:08:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:08:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:08:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:08:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:08:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:08:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:08:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:08:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:08:23,598 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:08:23,599 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:08:23,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:08:23 BoogieIcfgContainer [2019-09-08 07:08:23,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:08:23,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:08:23,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:08:23,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:08:23,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:08:22" (1/3) ... [2019-09-08 07:08:23,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbfc446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:08:23, skipping insertion in model container [2019-09-08 07:08:23,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:08:22" (2/3) ... [2019-09-08 07:08:23,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbfc446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:08:23, skipping insertion in model container [2019-09-08 07:08:23,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:08:23" (3/3) ... [2019-09-08 07:08:23,609 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:08:23,619 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:08:23,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:08:23,644 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:08:23,677 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:08:23,678 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:08:23,678 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:08:23,678 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:08:23,678 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:08:23,679 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:08:23,679 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:08:23,679 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:08:23,679 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:08:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-09-08 07:08:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 07:08:23,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:23,715 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] [2019-09-08 07:08:23,718 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1699942863, now seen corresponding path program 1 times [2019-09-08 07:08:23,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:23,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:23,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:23,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:24,223 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 07:08:24,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:24,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:08:24,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:08:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:08:24,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:08:24,246 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 5 states. [2019-09-08 07:08:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:24,401 INFO L93 Difference]: Finished difference Result 246 states and 393 transitions. [2019-09-08 07:08:24,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:08:24,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 07:08:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:24,417 INFO L225 Difference]: With dead ends: 246 [2019-09-08 07:08:24,417 INFO L226 Difference]: Without dead ends: 147 [2019-09-08 07:08:24,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 07:08:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-08 07:08:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-09-08 07:08:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-08 07:08:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 216 transitions. [2019-09-08 07:08:24,502 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 216 transitions. Word has length 56 [2019-09-08 07:08:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:24,502 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 216 transitions. [2019-09-08 07:08:24,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:08:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 216 transitions. [2019-09-08 07:08:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 07:08:24,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:24,507 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] [2019-09-08 07:08:24,507 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:24,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash 656573709, now seen corresponding path program 1 times [2019-09-08 07:08:24,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:24,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:24,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:24,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:24,789 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 07:08:24,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:24,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:08:24,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:08:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:08:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:08:24,793 INFO L87 Difference]: Start difference. First operand 147 states and 216 transitions. Second operand 9 states. [2019-09-08 07:08:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:27,808 INFO L93 Difference]: Finished difference Result 945 states and 1475 transitions. [2019-09-08 07:08:27,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 07:08:27,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-08 07:08:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:27,821 INFO L225 Difference]: With dead ends: 945 [2019-09-08 07:08:27,821 INFO L226 Difference]: Without dead ends: 855 [2019-09-08 07:08:27,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:08:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-09-08 07:08:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 583. [2019-09-08 07:08:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 07:08:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 900 transitions. [2019-09-08 07:08:27,910 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 900 transitions. Word has length 76 [2019-09-08 07:08:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:27,912 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 900 transitions. [2019-09-08 07:08:27,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:08:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 900 transitions. [2019-09-08 07:08:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 07:08:27,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:27,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:27,930 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:27,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1575528744, now seen corresponding path program 1 times [2019-09-08 07:08:27,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:27,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:27,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:27,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:27,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:28,138 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 07:08:28,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:28,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:08:28,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:08:28,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:08:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:08:28,140 INFO L87 Difference]: Start difference. First operand 583 states and 900 transitions. Second operand 6 states. [2019-09-08 07:08:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:29,269 INFO L93 Difference]: Finished difference Result 1657 states and 2580 transitions. [2019-09-08 07:08:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:08:29,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-08 07:08:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:29,279 INFO L225 Difference]: With dead ends: 1657 [2019-09-08 07:08:29,279 INFO L226 Difference]: Without dead ends: 1131 [2019-09-08 07:08:29,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:08:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2019-09-08 07:08:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 857. [2019-09-08 07:08:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-08 07:08:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1324 transitions. [2019-09-08 07:08:29,351 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1324 transitions. Word has length 77 [2019-09-08 07:08:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:29,354 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1324 transitions. [2019-09-08 07:08:29,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:08:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1324 transitions. [2019-09-08 07:08:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 07:08:29,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:29,358 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] [2019-09-08 07:08:29,359 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:29,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:29,359 INFO L82 PathProgramCache]: Analyzing trace with hash -53321180, now seen corresponding path program 1 times [2019-09-08 07:08:29,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:29,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:29,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:29,526 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 07:08:29,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:29,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:08:29,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:08:29,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:08:29,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:08:29,528 INFO L87 Difference]: Start difference. First operand 857 states and 1324 transitions. Second operand 6 states. [2019-09-08 07:08:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:30,675 INFO L93 Difference]: Finished difference Result 4093 states and 6392 transitions. [2019-09-08 07:08:30,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:08:30,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-08 07:08:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:30,701 INFO L225 Difference]: With dead ends: 4093 [2019-09-08 07:08:30,701 INFO L226 Difference]: Without dead ends: 3293 [2019-09-08 07:08:30,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:08:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-09-08 07:08:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 2471. [2019-09-08 07:08:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-09-08 07:08:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3844 transitions. [2019-09-08 07:08:30,869 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3844 transitions. Word has length 78 [2019-09-08 07:08:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:30,870 INFO L475 AbstractCegarLoop]: Abstraction has 2471 states and 3844 transitions. [2019-09-08 07:08:30,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:08:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3844 transitions. [2019-09-08 07:08:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 07:08:30,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:30,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:30,874 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash 940253791, now seen corresponding path program 1 times [2019-09-08 07:08:30,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:30,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:30,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:30,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:30,974 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 07:08:30,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:30,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:08:30,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:08:30,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:08:30,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:08:30,977 INFO L87 Difference]: Start difference. First operand 2471 states and 3844 transitions. Second operand 6 states. [2019-09-08 07:08:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:32,301 INFO L93 Difference]: Finished difference Result 12254 states and 19134 transitions. [2019-09-08 07:08:32,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:08:32,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-08 07:08:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:32,362 INFO L225 Difference]: With dead ends: 12254 [2019-09-08 07:08:32,363 INFO L226 Difference]: Without dead ends: 9840 [2019-09-08 07:08:32,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:08:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9840 states. [2019-09-08 07:08:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9840 to 9786. [2019-09-08 07:08:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9786 states. [2019-09-08 07:08:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9786 states to 9786 states and 15163 transitions. [2019-09-08 07:08:32,824 INFO L78 Accepts]: Start accepts. Automaton has 9786 states and 15163 transitions. Word has length 79 [2019-09-08 07:08:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:32,825 INFO L475 AbstractCegarLoop]: Abstraction has 9786 states and 15163 transitions. [2019-09-08 07:08:32,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:08:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 9786 states and 15163 transitions. [2019-09-08 07:08:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 07:08:32,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:32,828 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:32,828 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:32,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:32,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1343099753, now seen corresponding path program 1 times [2019-09-08 07:08:32,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:32,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:32,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:32,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:32,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:32,948 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 07:08:32,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:32,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:08:32,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:08:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:08:32,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:08:32,951 INFO L87 Difference]: Start difference. First operand 9786 states and 15163 transitions. Second operand 9 states. [2019-09-08 07:08:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:35,821 INFO L93 Difference]: Finished difference Result 17756 states and 27695 transitions. [2019-09-08 07:08:35,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:08:35,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 07:08:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:35,903 INFO L225 Difference]: With dead ends: 17756 [2019-09-08 07:08:35,903 INFO L226 Difference]: Without dead ends: 13881 [2019-09-08 07:08:35,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:08:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13881 states. [2019-09-08 07:08:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13881 to 11330. [2019-09-08 07:08:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11330 states. [2019-09-08 07:08:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11330 states to 11330 states and 17539 transitions. [2019-09-08 07:08:36,515 INFO L78 Accepts]: Start accepts. Automaton has 11330 states and 17539 transitions. Word has length 81 [2019-09-08 07:08:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:36,516 INFO L475 AbstractCegarLoop]: Abstraction has 11330 states and 17539 transitions. [2019-09-08 07:08:36,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:08:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 11330 states and 17539 transitions. [2019-09-08 07:08:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 07:08:36,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:36,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:36,520 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash -206911785, now seen corresponding path program 1 times [2019-09-08 07:08:36,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:36,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:36,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:36,592 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 07:08:36,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:36,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:08:36,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:08:36,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:08:36,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:08:36,594 INFO L87 Difference]: Start difference. First operand 11330 states and 17539 transitions. Second operand 4 states. [2019-09-08 07:08:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:37,502 INFO L93 Difference]: Finished difference Result 39718 states and 62331 transitions. [2019-09-08 07:08:37,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:08:37,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-08 07:08:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:37,655 INFO L225 Difference]: With dead ends: 39718 [2019-09-08 07:08:37,656 INFO L226 Difference]: Without dead ends: 28445 [2019-09-08 07:08:37,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:08:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28445 states. [2019-09-08 07:08:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28445 to 28090. [2019-09-08 07:08:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28090 states. [2019-09-08 07:08:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28090 states to 28090 states and 43038 transitions. [2019-09-08 07:08:40,063 INFO L78 Accepts]: Start accepts. Automaton has 28090 states and 43038 transitions. Word has length 81 [2019-09-08 07:08:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:40,064 INFO L475 AbstractCegarLoop]: Abstraction has 28090 states and 43038 transitions. [2019-09-08 07:08:40,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:08:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 28090 states and 43038 transitions. [2019-09-08 07:08:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 07:08:40,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:40,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:40,068 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:40,069 INFO L82 PathProgramCache]: Analyzing trace with hash -860983670, now seen corresponding path program 1 times [2019-09-08 07:08:40,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:40,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:40,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:40,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:40,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 07:08:40,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:40,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:08:40,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:08:40,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:08:40,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:08:40,248 INFO L87 Difference]: Start difference. First operand 28090 states and 43038 transitions. Second operand 10 states. [2019-09-08 07:08:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:45,701 INFO L93 Difference]: Finished difference Result 73531 states and 114986 transitions. [2019-09-08 07:08:45,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 07:08:45,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2019-09-08 07:08:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:45,955 INFO L225 Difference]: With dead ends: 73531 [2019-09-08 07:08:45,956 INFO L226 Difference]: Without dead ends: 51920 [2019-09-08 07:08:46,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:08:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51920 states. [2019-09-08 07:08:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51920 to 41834. [2019-09-08 07:08:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41834 states. [2019-09-08 07:08:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41834 states to 41834 states and 64312 transitions. [2019-09-08 07:08:48,063 INFO L78 Accepts]: Start accepts. Automaton has 41834 states and 64312 transitions. Word has length 82 [2019-09-08 07:08:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:48,063 INFO L475 AbstractCegarLoop]: Abstraction has 41834 states and 64312 transitions. [2019-09-08 07:08:48,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:08:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 41834 states and 64312 transitions. [2019-09-08 07:08:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 07:08:48,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:48,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] [2019-09-08 07:08:48,067 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash 525219724, now seen corresponding path program 1 times [2019-09-08 07:08:48,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:48,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:48,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:48,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:48,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:48,131 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 07:08:48,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:48,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:08:48,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:08:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:08:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:08:48,133 INFO L87 Difference]: Start difference. First operand 41834 states and 64312 transitions. Second operand 5 states. [2019-09-08 07:08:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:50,813 INFO L93 Difference]: Finished difference Result 96719 states and 150932 transitions. [2019-09-08 07:08:50,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:08:50,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 07:08:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:51,057 INFO L225 Difference]: With dead ends: 96719 [2019-09-08 07:08:51,058 INFO L226 Difference]: Without dead ends: 71687 [2019-09-08 07:08:51,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:08:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2019-09-08 07:08:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 71171. [2019-09-08 07:08:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71171 states. [2019-09-08 07:08:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71171 states to 71171 states and 110527 transitions. [2019-09-08 07:08:53,627 INFO L78 Accepts]: Start accepts. Automaton has 71171 states and 110527 transitions. Word has length 82 [2019-09-08 07:08:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:53,627 INFO L475 AbstractCegarLoop]: Abstraction has 71171 states and 110527 transitions. [2019-09-08 07:08:53,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:08:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 71171 states and 110527 transitions. [2019-09-08 07:08:53,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 07:08:53,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:53,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:53,632 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:53,632 INFO L82 PathProgramCache]: Analyzing trace with hash -779094876, now seen corresponding path program 1 times [2019-09-08 07:08:53,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:53,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:53,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 07:08:53,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:53,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:08:53,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:08:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:08:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:08:53,779 INFO L87 Difference]: Start difference. First operand 71171 states and 110527 transitions. Second operand 11 states. [2019-09-08 07:08:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:59,754 INFO L93 Difference]: Finished difference Result 158738 states and 252865 transitions. [2019-09-08 07:08:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 07:08:59,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-09-08 07:08:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:00,088 INFO L225 Difference]: With dead ends: 158738 [2019-09-08 07:09:00,088 INFO L226 Difference]: Without dead ends: 98604 [2019-09-08 07:09:00,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:09:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98604 states. [2019-09-08 07:09:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98604 to 79807. [2019-09-08 07:09:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79807 states. [2019-09-08 07:09:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79807 states to 79807 states and 126134 transitions. [2019-09-08 07:09:03,259 INFO L78 Accepts]: Start accepts. Automaton has 79807 states and 126134 transitions. Word has length 83 [2019-09-08 07:09:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:03,259 INFO L475 AbstractCegarLoop]: Abstraction has 79807 states and 126134 transitions. [2019-09-08 07:09:03,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:09:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 79807 states and 126134 transitions. [2019-09-08 07:09:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 07:09:03,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:03,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:09:03,264 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:03,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:03,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2119450870, now seen corresponding path program 1 times [2019-09-08 07:09:03,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:03,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:03,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:03,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:03,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:03,407 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 07:09:03,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:03,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:09:03,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:09:03,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:09:03,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:09:03,408 INFO L87 Difference]: Start difference. First operand 79807 states and 126134 transitions. Second operand 11 states. [2019-09-08 07:09:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:08,769 INFO L93 Difference]: Finished difference Result 184635 states and 298916 transitions. [2019-09-08 07:09:08,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 07:09:08,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-09-08 07:09:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:09,152 INFO L225 Difference]: With dead ends: 184635 [2019-09-08 07:09:09,153 INFO L226 Difference]: Without dead ends: 116286 [2019-09-08 07:09:09,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:09:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116286 states. [2019-09-08 07:09:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116286 to 78873. [2019-09-08 07:09:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78873 states. [2019-09-08 07:09:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78873 states to 78873 states and 124022 transitions. [2019-09-08 07:09:14,568 INFO L78 Accepts]: Start accepts. Automaton has 78873 states and 124022 transitions. Word has length 83 [2019-09-08 07:09:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:14,568 INFO L475 AbstractCegarLoop]: Abstraction has 78873 states and 124022 transitions. [2019-09-08 07:09:14,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:09:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 78873 states and 124022 transitions. [2019-09-08 07:09:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 07:09:14,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:14,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:09:14,571 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:14,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2114363208, now seen corresponding path program 1 times [2019-09-08 07:09:14,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:14,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:14,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:14,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:14,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:14,685 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 07:09:14,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:14,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:09:14,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:09:14,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:09:14,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:09:14,687 INFO L87 Difference]: Start difference. First operand 78873 states and 124022 transitions. Second operand 5 states. [2019-09-08 07:09:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:18,344 INFO L93 Difference]: Finished difference Result 234910 states and 375733 transitions. [2019-09-08 07:09:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:09:18,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 07:09:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:18,807 INFO L225 Difference]: With dead ends: 234910 [2019-09-08 07:09:18,807 INFO L226 Difference]: Without dead ends: 156051 [2019-09-08 07:09:18,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:09:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156051 states. [2019-09-08 07:09:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156051 to 156049. [2019-09-08 07:09:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156049 states. [2019-09-08 07:09:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156049 states to 156049 states and 242185 transitions. [2019-09-08 07:09:27,377 INFO L78 Accepts]: Start accepts. Automaton has 156049 states and 242185 transitions. Word has length 83 [2019-09-08 07:09:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:27,377 INFO L475 AbstractCegarLoop]: Abstraction has 156049 states and 242185 transitions. [2019-09-08 07:09:27,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:09:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 156049 states and 242185 transitions. [2019-09-08 07:09:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 07:09:27,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:27,382 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] [2019-09-08 07:09:27,382 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash 51740228, now seen corresponding path program 1 times [2019-09-08 07:09:27,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:27,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:27,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:27,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:27,435 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 07:09:27,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:27,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:09:27,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:09:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:09:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:09:27,436 INFO L87 Difference]: Start difference. First operand 156049 states and 242185 transitions. Second operand 3 states. [2019-09-08 07:09:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:31,198 INFO L93 Difference]: Finished difference Result 233308 states and 361839 transitions. [2019-09-08 07:09:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:09:31,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 07:09:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:31,614 INFO L225 Difference]: With dead ends: 233308 [2019-09-08 07:09:31,615 INFO L226 Difference]: Without dead ends: 156133 [2019-09-08 07:09:31,709 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 07:09:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156133 states. [2019-09-08 07:09:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156133 to 156051. [2019-09-08 07:09:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156051 states. [2019-09-08 07:09:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156051 states to 156051 states and 242187 transitions. [2019-09-08 07:09:40,114 INFO L78 Accepts]: Start accepts. Automaton has 156051 states and 242187 transitions. Word has length 84 [2019-09-08 07:09:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:40,114 INFO L475 AbstractCegarLoop]: Abstraction has 156051 states and 242187 transitions. [2019-09-08 07:09:40,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:09:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 156051 states and 242187 transitions. [2019-09-08 07:09:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:09:40,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:40,118 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] [2019-09-08 07:09:40,119 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:40,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2108278839, now seen corresponding path program 1 times [2019-09-08 07:09:40,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:40,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:40,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:40,224 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 07:09:40,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:40,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:09:40,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:09:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:09:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:09:40,226 INFO L87 Difference]: Start difference. First operand 156051 states and 242187 transitions. Second operand 5 states. [2019-09-08 07:09:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:51,516 INFO L93 Difference]: Finished difference Result 456824 states and 728259 transitions. [2019-09-08 07:09:51,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:09:51,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 07:09:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:52,358 INFO L225 Difference]: With dead ends: 456824 [2019-09-08 07:09:52,358 INFO L226 Difference]: Without dead ends: 300807 [2019-09-08 07:09:52,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:09:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300807 states. [2019-09-08 07:10:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300807 to 300805. [2019-09-08 07:10:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300805 states. [2019-09-08 07:10:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300805 states to 300805 states and 458235 transitions. [2019-09-08 07:10:09,822 INFO L78 Accepts]: Start accepts. Automaton has 300805 states and 458235 transitions. Word has length 85 [2019-09-08 07:10:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:09,822 INFO L475 AbstractCegarLoop]: Abstraction has 300805 states and 458235 transitions. [2019-09-08 07:10:09,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:10:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 300805 states and 458235 transitions. [2019-09-08 07:10:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:10:09,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:09,827 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] [2019-09-08 07:10:09,827 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash -302753363, now seen corresponding path program 1 times [2019-09-08 07:10:09,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:09,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:09,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:10,865 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 07:10:10,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:10:10,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:10:10,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:10:10,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:10:10,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:10:10,867 INFO L87 Difference]: Start difference. First operand 300805 states and 458235 transitions. Second operand 5 states. [2019-09-08 07:10:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:10:32,531 INFO L93 Difference]: Finished difference Result 895543 states and 1392809 transitions. [2019-09-08 07:10:32,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:10:32,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 07:10:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:10:35,106 INFO L225 Difference]: With dead ends: 895543 [2019-09-08 07:10:35,106 INFO L226 Difference]: Without dead ends: 594874 [2019-09-08 07:10:35,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:10:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594874 states. [2019-09-08 07:11:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594874 to 594872. [2019-09-08 07:11:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594872 states. [2019-09-08 07:11:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594872 states to 594872 states and 893150 transitions. [2019-09-08 07:11:15,649 INFO L78 Accepts]: Start accepts. Automaton has 594872 states and 893150 transitions. Word has length 85 [2019-09-08 07:11:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:11:15,650 INFO L475 AbstractCegarLoop]: Abstraction has 594872 states and 893150 transitions. [2019-09-08 07:11:15,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:11:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 594872 states and 893150 transitions. [2019-09-08 07:11:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:11:15,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:11:15,661 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] [2019-09-08 07:11:15,661 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:11:15,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:11:15,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1562373580, now seen corresponding path program 1 times [2019-09-08 07:11:15,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:11:15,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:11:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:11:15,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:11:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:11:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:11:17,512 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 07:11:17,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:11:17,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:11:17,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:11:17,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:11:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:11:17,516 INFO L87 Difference]: Start difference. First operand 594872 states and 893150 transitions. Second operand 5 states. [2019-09-08 07:11:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:11:59,185 INFO L93 Difference]: Finished difference Result 1475922 states and 2201328 transitions. [2019-09-08 07:11:59,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:11:59,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 07:11:59,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:12:02,565 INFO L225 Difference]: With dead ends: 1475922 [2019-09-08 07:12:02,565 INFO L226 Difference]: Without dead ends: 881730 [2019-09-08 07:12:03,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:12:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881730 states. [2019-09-08 07:13:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881730 to 805336. [2019-09-08 07:13:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805336 states. [2019-09-08 07:13:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805336 states to 805336 states and 1212782 transitions. [2019-09-08 07:13:05,953 INFO L78 Accepts]: Start accepts. Automaton has 805336 states and 1212782 transitions. Word has length 85 [2019-09-08 07:13:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:05,953 INFO L475 AbstractCegarLoop]: Abstraction has 805336 states and 1212782 transitions. [2019-09-08 07:13:05,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:13:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 805336 states and 1212782 transitions. [2019-09-08 07:13:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:13:05,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:05,962 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] [2019-09-08 07:13:05,962 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:05,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:05,963 INFO L82 PathProgramCache]: Analyzing trace with hash -594449608, now seen corresponding path program 1 times [2019-09-08 07:13:05,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:05,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:05,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:06,100 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 07:13:06,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:06,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:13:06,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:13:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:13:06,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:13:06,103 INFO L87 Difference]: Start difference. First operand 805336 states and 1212782 transitions. Second operand 9 states. [2019-09-08 07:13:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:49,006 INFO L93 Difference]: Finished difference Result 1340294 states and 2025871 transitions. [2019-09-08 07:13:49,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:13:49,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 07:13:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:52,021 INFO L225 Difference]: With dead ends: 1340294 [2019-09-08 07:13:52,021 INFO L226 Difference]: Without dead ends: 1070308 [2019-09-08 07:13:52,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:13:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070308 states. [2019-09-08 07:15:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070308 to 873024. [2019-09-08 07:15:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873024 states. [2019-09-08 07:15:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873024 states to 873024 states and 1307118 transitions. [2019-09-08 07:15:05,700 INFO L78 Accepts]: Start accepts. Automaton has 873024 states and 1307118 transitions. Word has length 85 [2019-09-08 07:15:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:05,700 INFO L475 AbstractCegarLoop]: Abstraction has 873024 states and 1307118 transitions. [2019-09-08 07:15:05,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:15:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 873024 states and 1307118 transitions. [2019-09-08 07:15:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 07:15:05,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:05,714 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] [2019-09-08 07:15:05,714 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash 304114063, now seen corresponding path program 1 times [2019-09-08 07:15:05,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:05,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:05,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:05,842 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 07:15:05,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:15:05,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:15:05,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:15:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:15:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:15:05,844 INFO L87 Difference]: Start difference. First operand 873024 states and 1307118 transitions. Second operand 10 states. [2019-09-08 07:16:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:30,265 INFO L93 Difference]: Finished difference Result 1845078 states and 2837684 transitions. [2019-09-08 07:16:30,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 07:16:30,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-08 07:16:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:36,825 INFO L225 Difference]: With dead ends: 1845078 [2019-09-08 07:16:36,825 INFO L226 Difference]: Without dead ends: 1617998 [2019-09-08 07:16:37,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:16:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617998 states.