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.3.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:13:03,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:13:03,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:13:03,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:13:03,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:13:03,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:13:03,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:13:03,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:13:03,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:13:03,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:13:03,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:13:04,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:13:04,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:13:04,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:13:04,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:13:04,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:13:04,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:13:04,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:13:04,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:13:04,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:13:04,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:13:04,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:13:04,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:13:04,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:13:04,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:13:04,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:13:04,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:13:04,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:13:04,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:13:04,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:13:04,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:13:04,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:13:04,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:13:04,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:13:04,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:13:04,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:13:04,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:13:04,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:13:04,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:13:04,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:13:04,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:13:04,036 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:13:04,061 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:13:04,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:13:04,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:13:04,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:13:04,065 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:13:04,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:13:04,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:13:04,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:13:04,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:13:04,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:13:04,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:13:04,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:13:04,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:13:04,068 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:13:04,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:13:04,068 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:13:04,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:13:04,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:13:04,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:13:04,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:13:04,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:13:04,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:13:04,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:13:04,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:13:04,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:13:04,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:13:04,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:13:04,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:13:04,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:13:04,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:13:04,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:13:04,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:13:04,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:13:04,140 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:13:04,141 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-08 07:13:04,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97332f50/2fcaf779626b464d9912adde8f6e35a9/FLAG2a8bd20d7 [2019-09-08 07:13:04,713 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:13:04,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-08 07:13:04,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97332f50/2fcaf779626b464d9912adde8f6e35a9/FLAG2a8bd20d7 [2019-09-08 07:13:05,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97332f50/2fcaf779626b464d9912adde8f6e35a9 [2019-09-08 07:13:05,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:13:05,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:13:05,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:13:05,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:13:05,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:13:05,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baf7c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05, skipping insertion in model container [2019-09-08 07:13:05,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,085 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:13:05,146 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:13:05,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:13:05,486 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:13:05,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:13:05,597 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:13:05,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05 WrapperNode [2019-09-08 07:13:05,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:13:05,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:13:05,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:13:05,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:13:05,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (1/1) ... [2019-09-08 07:13:05,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:13:05,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:13:05,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:13:05,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:13:05,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (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:13:05,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:13:05,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:13:05,739 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:13:05,739 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:13:05,739 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:13:05,739 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:13:05,739 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:13:05,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:13:05,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:13:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:13:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:13:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:13:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:13:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:13:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:13:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:13:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:13:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:13:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:13:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:13:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:13:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:13:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:13:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:13:06,535 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:13:06,536 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:13:06,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:13:06 BoogieIcfgContainer [2019-09-08 07:13:06,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:13:06,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:13:06,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:13:06,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:13:06,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:13:05" (1/3) ... [2019-09-08 07:13:06,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65feb25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:13:06, skipping insertion in model container [2019-09-08 07:13:06,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:13:05" (2/3) ... [2019-09-08 07:13:06,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65feb25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:13:06, skipping insertion in model container [2019-09-08 07:13:06,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:13:06" (3/3) ... [2019-09-08 07:13:06,549 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-08 07:13:06,560 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:13:06,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:13:06,588 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:13:06,642 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:13:06,643 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:13:06,643 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:13:06,644 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:13:06,644 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:13:06,644 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:13:06,644 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:13:06,645 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:13:06,645 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:13:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-09-08 07:13:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 07:13:06,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:06,681 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:13:06,684 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash -184592063, now seen corresponding path program 1 times [2019-09-08 07:13:06,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:06,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:07,128 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:07,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:07,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:13:07,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:13:07,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:13:07,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:13:07,159 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 5 states. [2019-09-08 07:13:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:07,382 INFO L93 Difference]: Finished difference Result 247 states and 393 transitions. [2019-09-08 07:13:07,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:13:07,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 07:13:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:07,407 INFO L225 Difference]: With dead ends: 247 [2019-09-08 07:13:07,408 INFO L226 Difference]: Without dead ends: 148 [2019-09-08 07:13:07,416 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:13:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-08 07:13:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-09-08 07:13:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-08 07:13:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2019-09-08 07:13:07,509 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 56 [2019-09-08 07:13:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:07,510 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2019-09-08 07:13:07,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:13:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2019-09-08 07:13:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 07:13:07,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:07,519 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:13:07,519 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1678809448, now seen corresponding path program 1 times [2019-09-08 07:13:07,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:07,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:07,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:07,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:07,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:07,688 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:07,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:07,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:13:07,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:13:07,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:13:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:13:07,693 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand 5 states. [2019-09-08 07:13:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:08,355 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2019-09-08 07:13:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:13:08,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 07:13:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:08,362 INFO L225 Difference]: With dead ends: 320 [2019-09-08 07:13:08,363 INFO L226 Difference]: Without dead ends: 235 [2019-09-08 07:13:08,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:13:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-08 07:13:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-09-08 07:13:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 07:13:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 330 transitions. [2019-09-08 07:13:08,393 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 330 transitions. Word has length 82 [2019-09-08 07:13:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:08,394 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 330 transitions. [2019-09-08 07:13:08,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:13:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 330 transitions. [2019-09-08 07:13:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 07:13:08,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:08,399 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:13:08,399 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:08,400 INFO L82 PathProgramCache]: Analyzing trace with hash 648323325, now seen corresponding path program 1 times [2019-09-08 07:13:08,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:08,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:08,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:08,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:08,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:08,629 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:08,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:08,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:13:08,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:13:08,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:13:08,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:13:08,631 INFO L87 Difference]: Start difference. First operand 227 states and 330 transitions. Second operand 5 states. [2019-09-08 07:13:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:09,240 INFO L93 Difference]: Finished difference Result 551 states and 816 transitions. [2019-09-08 07:13:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:13:09,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 07:13:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:09,249 INFO L225 Difference]: With dead ends: 551 [2019-09-08 07:13:09,250 INFO L226 Difference]: Without dead ends: 387 [2019-09-08 07:13:09,252 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:13:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-08 07:13:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 379. [2019-09-08 07:13:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-09-08 07:13:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 556 transitions. [2019-09-08 07:13:09,327 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 556 transitions. Word has length 84 [2019-09-08 07:13:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:09,328 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 556 transitions. [2019-09-08 07:13:09,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:13:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 556 transitions. [2019-09-08 07:13:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 07:13:09,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:09,337 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] [2019-09-08 07:13:09,338 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1070567230, now seen corresponding path program 1 times [2019-09-08 07:13:09,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:09,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:09,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:09,460 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:09,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:09,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:13:09,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:13:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:13:09,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:13:09,462 INFO L87 Difference]: Start difference. First operand 379 states and 556 transitions. Second operand 5 states. [2019-09-08 07:13:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:09,995 INFO L93 Difference]: Finished difference Result 1003 states and 1482 transitions. [2019-09-08 07:13:09,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:13:09,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 07:13:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:10,005 INFO L225 Difference]: With dead ends: 1003 [2019-09-08 07:13:10,005 INFO L226 Difference]: Without dead ends: 687 [2019-09-08 07:13:10,009 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:13:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-08 07:13:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 673. [2019-09-08 07:13:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-08 07:13:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 986 transitions. [2019-09-08 07:13:10,071 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 986 transitions. Word has length 86 [2019-09-08 07:13:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:10,072 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 986 transitions. [2019-09-08 07:13:10,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:13:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 986 transitions. [2019-09-08 07:13:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 07:13:10,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:10,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:10,076 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:10,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:10,077 INFO L82 PathProgramCache]: Analyzing trace with hash 219817383, now seen corresponding path program 1 times [2019-09-08 07:13:10,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:10,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:10,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:10,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:10,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:10,255 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:10,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:10,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:13:10,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:13:10,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:13:10,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:13:10,260 INFO L87 Difference]: Start difference. First operand 673 states and 986 transitions. Second operand 9 states. [2019-09-08 07:13:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:12,824 INFO L93 Difference]: Finished difference Result 3762 states and 5693 transitions. [2019-09-08 07:13:12,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 07:13:12,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 07:13:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:12,849 INFO L225 Difference]: With dead ends: 3762 [2019-09-08 07:13:12,850 INFO L226 Difference]: Without dead ends: 3152 [2019-09-08 07:13:12,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:13:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2019-09-08 07:13:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3072. [2019-09-08 07:13:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-09-08 07:13:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4642 transitions. [2019-09-08 07:13:13,045 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4642 transitions. Word has length 88 [2019-09-08 07:13:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:13,046 INFO L475 AbstractCegarLoop]: Abstraction has 3072 states and 4642 transitions. [2019-09-08 07:13:13,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:13:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4642 transitions. [2019-09-08 07:13:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 07:13:13,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:13,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:13,052 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:13,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:13,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1684330053, now seen corresponding path program 1 times [2019-09-08 07:13:13,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:13,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:13,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:13,135 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:13,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:13,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:13:13,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:13:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:13:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:13:13,138 INFO L87 Difference]: Start difference. First operand 3072 states and 4642 transitions. Second operand 5 states. [2019-09-08 07:13:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:13,777 INFO L93 Difference]: Finished difference Result 6318 states and 9717 transitions. [2019-09-08 07:13:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:13:13,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-08 07:13:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:13,822 INFO L225 Difference]: With dead ends: 6318 [2019-09-08 07:13:13,823 INFO L226 Difference]: Without dead ends: 5387 [2019-09-08 07:13:13,832 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:13:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2019-09-08 07:13:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5279. [2019-09-08 07:13:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5279 states. [2019-09-08 07:13:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 8097 transitions. [2019-09-08 07:13:14,241 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 8097 transitions. Word has length 89 [2019-09-08 07:13:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:14,242 INFO L475 AbstractCegarLoop]: Abstraction has 5279 states and 8097 transitions. [2019-09-08 07:13:14,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:13:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 8097 transitions. [2019-09-08 07:13:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 07:13:14,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:14,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:14,256 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1824580059, now seen corresponding path program 1 times [2019-09-08 07:13:14,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:14,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:14,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:14,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:14,508 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:14,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:14,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:13:14,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:13:14,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:13:14,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:13:14,510 INFO L87 Difference]: Start difference. First operand 5279 states and 8097 transitions. Second operand 6 states. [2019-09-08 07:13:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:15,785 INFO L93 Difference]: Finished difference Result 13931 states and 21440 transitions. [2019-09-08 07:13:15,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:13:15,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-08 07:13:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:15,855 INFO L225 Difference]: With dead ends: 13931 [2019-09-08 07:13:15,856 INFO L226 Difference]: Without dead ends: 8715 [2019-09-08 07:13:15,880 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:13:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2019-09-08 07:13:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 8607. [2019-09-08 07:13:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8607 states. [2019-09-08 07:13:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8607 states to 8607 states and 13235 transitions. [2019-09-08 07:13:16,430 INFO L78 Accepts]: Start accepts. Automaton has 8607 states and 13235 transitions. Word has length 89 [2019-09-08 07:13:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:16,430 INFO L475 AbstractCegarLoop]: Abstraction has 8607 states and 13235 transitions. [2019-09-08 07:13:16,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:13:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 8607 states and 13235 transitions. [2019-09-08 07:13:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 07:13:16,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:16,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:16,442 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1229618911, now seen corresponding path program 1 times [2019-09-08 07:13:16,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:16,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:16,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:16,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:16,627 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:16,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:16,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:13:16,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:13:16,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:13:16,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:13:16,629 INFO L87 Difference]: Start difference. First operand 8607 states and 13235 transitions. Second operand 9 states. [2019-09-08 07:13:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:19,422 INFO L93 Difference]: Finished difference Result 20947 states and 32361 transitions. [2019-09-08 07:13:19,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 07:13:19,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 07:13:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:19,525 INFO L225 Difference]: With dead ends: 20947 [2019-09-08 07:13:19,526 INFO L226 Difference]: Without dead ends: 15681 [2019-09-08 07:13:19,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 07:13:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15681 states. [2019-09-08 07:13:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15681 to 13502. [2019-09-08 07:13:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13502 states. [2019-09-08 07:13:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13502 states to 13502 states and 20839 transitions. [2019-09-08 07:13:20,159 INFO L78 Accepts]: Start accepts. Automaton has 13502 states and 20839 transitions. Word has length 89 [2019-09-08 07:13:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:20,159 INFO L475 AbstractCegarLoop]: Abstraction has 13502 states and 20839 transitions. [2019-09-08 07:13:20,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:13:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13502 states and 20839 transitions. [2019-09-08 07:13:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 07:13:20,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:20,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:20,166 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:20,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2057730764, now seen corresponding path program 1 times [2019-09-08 07:13:20,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:20,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:20,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:20,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:20,360 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:20,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:20,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:13:20,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:13:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:13:20,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:13:20,362 INFO L87 Difference]: Start difference. First operand 13502 states and 20839 transitions. Second operand 9 states. [2019-09-08 07:13:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:23,607 INFO L93 Difference]: Finished difference Result 27243 states and 42214 transitions. [2019-09-08 07:13:23,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:13:23,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 07:13:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:23,708 INFO L225 Difference]: With dead ends: 27243 [2019-09-08 07:13:23,708 INFO L226 Difference]: Without dead ends: 20973 [2019-09-08 07:13:23,733 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:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20973 states. [2019-09-08 07:13:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20973 to 18576. [2019-09-08 07:13:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18576 states. [2019-09-08 07:13:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18576 states to 18576 states and 28751 transitions. [2019-09-08 07:13:24,666 INFO L78 Accepts]: Start accepts. Automaton has 18576 states and 28751 transitions. Word has length 89 [2019-09-08 07:13:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:24,667 INFO L475 AbstractCegarLoop]: Abstraction has 18576 states and 28751 transitions. [2019-09-08 07:13:24,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:13:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 18576 states and 28751 transitions. [2019-09-08 07:13:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 07:13:24,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:24,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:24,676 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash 320047691, now seen corresponding path program 1 times [2019-09-08 07:13:24,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:24,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:24,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:24,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:24,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:24,988 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:24,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:24,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:13:24,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:13:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:13:24,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:13:24,990 INFO L87 Difference]: Start difference. First operand 18576 states and 28751 transitions. Second operand 11 states. [2019-09-08 07:13:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:27,155 INFO L93 Difference]: Finished difference Result 44331 states and 69317 transitions. [2019-09-08 07:13:27,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 07:13:27,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-09-08 07:13:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:27,295 INFO L225 Difference]: With dead ends: 44331 [2019-09-08 07:13:27,295 INFO L226 Difference]: Without dead ends: 29493 [2019-09-08 07:13:27,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:13:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29493 states. [2019-09-08 07:13:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29493 to 18720. [2019-09-08 07:13:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18720 states. [2019-09-08 07:13:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18720 states to 18720 states and 28972 transitions. [2019-09-08 07:13:28,507 INFO L78 Accepts]: Start accepts. Automaton has 18720 states and 28972 transitions. Word has length 90 [2019-09-08 07:13:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:28,507 INFO L475 AbstractCegarLoop]: Abstraction has 18720 states and 28972 transitions. [2019-09-08 07:13:28,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:13:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 18720 states and 28972 transitions. [2019-09-08 07:13:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 07:13:28,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:28,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:28,516 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash 52219131, now seen corresponding path program 1 times [2019-09-08 07:13:28,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:28,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:28,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:28,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:28,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:28,624 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:28,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:28,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:13:28,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:13:28,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:13:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:13:28,626 INFO L87 Difference]: Start difference. First operand 18720 states and 28972 transitions. Second operand 7 states. [2019-09-08 07:13:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:30,557 INFO L93 Difference]: Finished difference Result 36301 states and 56414 transitions. [2019-09-08 07:13:30,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:13:30,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 07:13:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:30,650 INFO L225 Difference]: With dead ends: 36301 [2019-09-08 07:13:30,650 INFO L226 Difference]: Without dead ends: 24035 [2019-09-08 07:13:30,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:13:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2019-09-08 07:13:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 23912. [2019-09-08 07:13:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23912 states. [2019-09-08 07:13:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23912 states to 23912 states and 37103 transitions. [2019-09-08 07:13:31,973 INFO L78 Accepts]: Start accepts. Automaton has 23912 states and 37103 transitions. Word has length 90 [2019-09-08 07:13:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:31,974 INFO L475 AbstractCegarLoop]: Abstraction has 23912 states and 37103 transitions. [2019-09-08 07:13:31,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:13:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 23912 states and 37103 transitions. [2019-09-08 07:13:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 07:13:31,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:31,983 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:31,984 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash -19069474, now seen corresponding path program 1 times [2019-09-08 07:13:31,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:31,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:31,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:32,157 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:32,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:32,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:13:32,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:13:32,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:13:32,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:13:32,159 INFO L87 Difference]: Start difference. First operand 23912 states and 37103 transitions. Second operand 6 states. [2019-09-08 07:13:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:34,626 INFO L93 Difference]: Finished difference Result 64758 states and 100813 transitions. [2019-09-08 07:13:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:13:34,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-08 07:13:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:34,772 INFO L225 Difference]: With dead ends: 64758 [2019-09-08 07:13:34,772 INFO L226 Difference]: Without dead ends: 41030 [2019-09-08 07:13:34,820 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:13:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41030 states. [2019-09-08 07:13:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41030 to 40740. [2019-09-08 07:13:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40740 states. [2019-09-08 07:13:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40740 states to 40740 states and 63283 transitions. [2019-09-08 07:13:36,866 INFO L78 Accepts]: Start accepts. Automaton has 40740 states and 63283 transitions. Word has length 90 [2019-09-08 07:13:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:36,866 INFO L475 AbstractCegarLoop]: Abstraction has 40740 states and 63283 transitions. [2019-09-08 07:13:36,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:13:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 40740 states and 63283 transitions. [2019-09-08 07:13:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 07:13:36,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:36,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:36,875 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:36,876 INFO L82 PathProgramCache]: Analyzing trace with hash -654896910, now seen corresponding path program 1 times [2019-09-08 07:13:36,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:36,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:36,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:37,098 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:37,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:37,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:13:37,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:13:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:13:37,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:13:37,100 INFO L87 Difference]: Start difference. First operand 40740 states and 63283 transitions. Second operand 6 states. [2019-09-08 07:13:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:39,015 INFO L93 Difference]: Finished difference Result 68298 states and 106575 transitions. [2019-09-08 07:13:39,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:13:39,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-08 07:13:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:39,187 INFO L225 Difference]: With dead ends: 68298 [2019-09-08 07:13:39,188 INFO L226 Difference]: Without dead ends: 42076 [2019-09-08 07:13:39,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:13:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42076 states. [2019-09-08 07:13:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42076 to 40685. [2019-09-08 07:13:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40685 states. [2019-09-08 07:13:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40685 states to 40685 states and 63026 transitions. [2019-09-08 07:13:42,385 INFO L78 Accepts]: Start accepts. Automaton has 40685 states and 63026 transitions. Word has length 90 [2019-09-08 07:13:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:42,385 INFO L475 AbstractCegarLoop]: Abstraction has 40685 states and 63026 transitions. [2019-09-08 07:13:42,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:13:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 40685 states and 63026 transitions. [2019-09-08 07:13:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 07:13:42,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:42,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:42,390 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash 85581349, now seen corresponding path program 1 times [2019-09-08 07:13:42,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:42,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:42,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:42,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:42,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:42,523 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:42,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:42,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:13:42,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:13:42,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:13:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:13:42,525 INFO L87 Difference]: Start difference. First operand 40685 states and 63026 transitions. Second operand 11 states. [2019-09-08 07:13:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:45,362 INFO L93 Difference]: Finished difference Result 101201 states and 158693 transitions. [2019-09-08 07:13:45,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 07:13:45,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-09-08 07:13:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:45,611 INFO L225 Difference]: With dead ends: 101201 [2019-09-08 07:13:45,611 INFO L226 Difference]: Without dead ends: 67117 [2019-09-08 07:13:45,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:13:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67117 states. [2019-09-08 07:13:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67117 to 40684. [2019-09-08 07:13:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40684 states. [2019-09-08 07:13:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40684 states to 40684 states and 63023 transitions. [2019-09-08 07:13:48,877 INFO L78 Accepts]: Start accepts. Automaton has 40684 states and 63023 transitions. Word has length 90 [2019-09-08 07:13:48,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:48,877 INFO L475 AbstractCegarLoop]: Abstraction has 40684 states and 63023 transitions. [2019-09-08 07:13:48,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:13:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 40684 states and 63023 transitions. [2019-09-08 07:13:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:13:48,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:48,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:48,881 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1389315086, now seen corresponding path program 1 times [2019-09-08 07:13:48,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:48,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:48,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:48,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:48,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:48,968 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:48,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:48,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:13:48,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:13:48,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:13:48,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:13:48,969 INFO L87 Difference]: Start difference. First operand 40684 states and 63023 transitions. Second operand 6 states. [2019-09-08 07:13:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:13:51,722 INFO L93 Difference]: Finished difference Result 121845 states and 189768 transitions. [2019-09-08 07:13:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:13:51,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 07:13:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:13:51,926 INFO L225 Difference]: With dead ends: 121845 [2019-09-08 07:13:51,926 INFO L226 Difference]: Without dead ends: 81318 [2019-09-08 07:13:51,992 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:13:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81318 states. [2019-09-08 07:13:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81318 to 80363. [2019-09-08 07:13:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80363 states. [2019-09-08 07:13:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80363 states to 80363 states and 124428 transitions. [2019-09-08 07:13:56,196 INFO L78 Accepts]: Start accepts. Automaton has 80363 states and 124428 transitions. Word has length 91 [2019-09-08 07:13:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:13:56,196 INFO L475 AbstractCegarLoop]: Abstraction has 80363 states and 124428 transitions. [2019-09-08 07:13:56,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:13:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 80363 states and 124428 transitions. [2019-09-08 07:13:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 07:13:56,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:13:56,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:13:56,200 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:13:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:13:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash -342935622, now seen corresponding path program 1 times [2019-09-08 07:13:56,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:13:56,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:13:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:56,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:13:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:13:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:13:56,315 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:56,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:13:56,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:13:56,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:13:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:13:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:13:56,317 INFO L87 Difference]: Start difference. First operand 80363 states and 124428 transitions. Second operand 10 states. [2019-09-08 07:14:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:14:03,677 INFO L93 Difference]: Finished difference Result 188434 states and 293884 transitions. [2019-09-08 07:14:03,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 07:14:03,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-08 07:14:03,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:14:03,979 INFO L225 Difference]: With dead ends: 188434 [2019-09-08 07:14:03,979 INFO L226 Difference]: Without dead ends: 127252 [2019-09-08 07:14:04,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=308, Invalid=952, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 07:14:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127252 states. [2019-09-08 07:14:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127252 to 125846. [2019-09-08 07:14:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125846 states. [2019-09-08 07:14:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125846 states to 125846 states and 196232 transitions. [2019-09-08 07:14:10,644 INFO L78 Accepts]: Start accepts. Automaton has 125846 states and 196232 transitions. Word has length 92 [2019-09-08 07:14:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:14:10,644 INFO L475 AbstractCegarLoop]: Abstraction has 125846 states and 196232 transitions. [2019-09-08 07:14:10,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:14:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 125846 states and 196232 transitions. [2019-09-08 07:14:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 07:14:10,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:14:10,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:10,647 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:14:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:14:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2031879364, now seen corresponding path program 1 times [2019-09-08 07:14:10,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:14:10,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:14:10,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:10,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:10,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:10,756 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:14:10,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:14:10,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:14:10,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:14:10,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:14:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:14:10,758 INFO L87 Difference]: Start difference. First operand 125846 states and 196232 transitions. Second operand 7 states. [2019-09-08 07:14:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:14:15,454 INFO L93 Difference]: Finished difference Result 215671 states and 337327 transitions. [2019-09-08 07:14:15,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:14:15,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-08 07:14:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:14:15,765 INFO L225 Difference]: With dead ends: 215671 [2019-09-08 07:14:15,766 INFO L226 Difference]: Without dead ends: 122738 [2019-09-08 07:14:15,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:14:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122738 states. [2019-09-08 07:14:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122738 to 121176. [2019-09-08 07:14:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121176 states. [2019-09-08 07:14:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121176 states to 121176 states and 189205 transitions. [2019-09-08 07:14:23,291 INFO L78 Accepts]: Start accepts. Automaton has 121176 states and 189205 transitions. Word has length 92 [2019-09-08 07:14:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:14:23,292 INFO L475 AbstractCegarLoop]: Abstraction has 121176 states and 189205 transitions. [2019-09-08 07:14:23,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:14:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 121176 states and 189205 transitions. [2019-09-08 07:14:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:14:23,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:14:23,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:14:23,295 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:14:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:14:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1900611914, now seen corresponding path program 1 times [2019-09-08 07:14:23,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:14:23,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:14:23,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:23,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:23,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:23,433 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:14:23,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:14:23,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:14:23,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:14:23,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:14:23,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:14:23,435 INFO L87 Difference]: Start difference. First operand 121176 states and 189205 transitions. Second operand 5 states. [2019-09-08 07:14:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:14:31,239 INFO L93 Difference]: Finished difference Result 318936 states and 499997 transitions. [2019-09-08 07:14:31,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:14:31,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:14:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:14:31,884 INFO L225 Difference]: With dead ends: 318936 [2019-09-08 07:14:31,885 INFO L226 Difference]: Without dead ends: 206128 [2019-09-08 07:14:32,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:14:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206128 states. [2019-09-08 07:14:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206128 to 206114. [2019-09-08 07:14:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206114 states. [2019-09-08 07:14:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206114 states to 206114 states and 316756 transitions. [2019-09-08 07:14:44,289 INFO L78 Accepts]: Start accepts. Automaton has 206114 states and 316756 transitions. Word has length 93 [2019-09-08 07:14:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:14:44,289 INFO L475 AbstractCegarLoop]: Abstraction has 206114 states and 316756 transitions. [2019-09-08 07:14:44,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:14:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 206114 states and 316756 transitions. [2019-09-08 07:14:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:14:44,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:14:44,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:14:44,291 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:14:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:14:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash 815188096, now seen corresponding path program 1 times [2019-09-08 07:14:44,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:14:44,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:14:44,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:44,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:44,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:44,393 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:14:44,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:14:44,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:14:44,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:14:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:14:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:14:44,395 INFO L87 Difference]: Start difference. First operand 206114 states and 316756 transitions. Second operand 5 states. [2019-09-08 07:15:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:02,404 INFO L93 Difference]: Finished difference Result 613400 states and 961080 transitions. [2019-09-08 07:15:02,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:15:02,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:15:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:03,644 INFO L225 Difference]: With dead ends: 613400 [2019-09-08 07:15:03,644 INFO L226 Difference]: Without dead ends: 407300 [2019-09-08 07:15:03,961 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:15:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407300 states. [2019-09-08 07:15:32,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407300 to 407298. [2019-09-08 07:15:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407298 states. [2019-09-08 07:15:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407298 states to 407298 states and 617886 transitions. [2019-09-08 07:15:33,562 INFO L78 Accepts]: Start accepts. Automaton has 407298 states and 617886 transitions. Word has length 93 [2019-09-08 07:15:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:33,563 INFO L475 AbstractCegarLoop]: Abstraction has 407298 states and 617886 transitions. [2019-09-08 07:15:33,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:15:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 407298 states and 617886 transitions. [2019-09-08 07:15:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:15:33,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:33,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:15:33,566 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:33,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:33,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1780635836, now seen corresponding path program 1 times [2019-09-08 07:15:33,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:33,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:33,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:33,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:33,608 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:33,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:15:33,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:15:33,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:15:33,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:15:33,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:15:33,609 INFO L87 Difference]: Start difference. First operand 407298 states and 617886 transitions. Second operand 3 states. [2019-09-08 07:15:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:55,109 INFO L93 Difference]: Finished difference Result 608577 states and 922697 transitions. [2019-09-08 07:15:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:15:55,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 07:15:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:56,316 INFO L225 Difference]: With dead ends: 608577 [2019-09-08 07:15:56,316 INFO L226 Difference]: Without dead ends: 407394 [2019-09-08 07:15:56,572 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:15:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407394 states. [2019-09-08 07:16:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407394 to 407300. [2019-09-08 07:16:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407300 states. [2019-09-08 07:16:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407300 states to 407300 states and 617888 transitions. [2019-09-08 07:16:25,877 INFO L78 Accepts]: Start accepts. Automaton has 407300 states and 617888 transitions. Word has length 94 [2019-09-08 07:16:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:25,878 INFO L475 AbstractCegarLoop]: Abstraction has 407300 states and 617888 transitions. [2019-09-08 07:16:25,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:16:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 407300 states and 617888 transitions. [2019-09-08 07:16:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 07:16:25,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:25,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:16:25,880 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1870900251, now seen corresponding path program 1 times [2019-09-08 07:16:25,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:25,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:25,980 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:16:25,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:25,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:16:25,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:16:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:16:25,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:16:25,983 INFO L87 Difference]: Start difference. First operand 407300 states and 617888 transitions. Second operand 5 states. [2019-09-08 07:17:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:10,051 INFO L93 Difference]: Finished difference Result 1211163 states and 1880921 transitions. [2019-09-08 07:17:10,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:17:10,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 07:17:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:13,379 INFO L225 Difference]: With dead ends: 1211163 [2019-09-08 07:17:13,379 INFO L226 Difference]: Without dead ends: 803890 [2019-09-08 07:17:14,035 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:17:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803890 states. [2019-09-08 07:18:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803890 to 803888. [2019-09-08 07:18:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803888 states. [2019-09-08 07:18:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803888 states to 803888 states and 1201102 transitions. [2019-09-08 07:18:18,601 INFO L78 Accepts]: Start accepts. Automaton has 803888 states and 1201102 transitions. Word has length 95 [2019-09-08 07:18:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:18,602 INFO L475 AbstractCegarLoop]: Abstraction has 803888 states and 1201102 transitions. [2019-09-08 07:18:18,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:18:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 803888 states and 1201102 transitions. [2019-09-08 07:18:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 07:18:18,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:18,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:18:18,605 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1487938196, now seen corresponding path program 1 times [2019-09-08 07:18:18,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:18,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:18,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:18,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:18,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:18,693 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:18:18,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:18,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:18:18,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:18:18,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:18:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:18:18,694 INFO L87 Difference]: Start difference. First operand 803888 states and 1201102 transitions. Second operand 4 states. [2019-09-08 07:18:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:53,435 INFO L93 Difference]: Finished difference Result 1004642 states and 1500943 transitions. [2019-09-08 07:18:53,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:18:53,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-08 07:18:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:55,189 INFO L225 Difference]: With dead ends: 1004642 [2019-09-08 07:18:55,189 INFO L226 Difference]: Without dead ends: 608049 [2019-09-08 07:18:55,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:18:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608049 states. [2019-09-08 07:19:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608049 to 608049. [2019-09-08 07:19:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608049 states. [2019-09-08 07:19:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608049 states to 608049 states and 909736 transitions. [2019-09-08 07:19:51,111 INFO L78 Accepts]: Start accepts. Automaton has 608049 states and 909736 transitions. Word has length 95 [2019-09-08 07:19:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:51,112 INFO L475 AbstractCegarLoop]: Abstraction has 608049 states and 909736 transitions. [2019-09-08 07:19:51,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:19:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 608049 states and 909736 transitions. [2019-09-08 07:19:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 07:19:51,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:51,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:51,114 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash -22996116, now seen corresponding path program 1 times [2019-09-08 07:19:51,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:51,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:51,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:51,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:51,229 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:19:51,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:51,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:19:51,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:19:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:19:51,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:19:51,230 INFO L87 Difference]: Start difference. First operand 608049 states and 909736 transitions. Second operand 5 states. [2019-09-08 07:21:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:06,881 INFO L93 Difference]: Finished difference Result 1800005 states and 2740703 transitions. [2019-09-08 07:21:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:21:06,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 07:21:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:10,725 INFO L225 Difference]: With dead ends: 1800005 [2019-09-08 07:21:10,725 INFO L226 Difference]: Without dead ends: 1191994 [2019-09-08 07:21:13,182 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:21:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191994 states.