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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:05:43,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:05:43,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:05:43,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:05:43,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:05:43,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:05:43,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:05:43,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:05:43,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:05:43,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:05:43,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:05:43,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:05:43,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:05:43,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:05:43,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:05:43,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:05:43,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:05:43,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:05:43,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:05:43,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:05:43,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:05:43,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:05:43,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:05:43,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:05:43,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:05:43,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:05:43,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:05:43,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:05:43,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:05:43,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:05:43,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:05:43,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:05:43,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:05:43,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:05:43,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:05:43,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:05:43,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:05:43,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:05:43,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:05:43,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:05:43,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:05:43,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:05:43,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:05:43,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:05:43,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:05:43,863 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:05:43,863 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:05:43,864 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:05:43,864 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:05:43,864 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:05:43,864 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:05:43,864 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:05:43,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:05:43,867 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:05:43,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:05:43,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:05:43,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:05:43,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:05:43,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:05:43,868 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:05:43,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:05:43,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:05:43,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:05:43,870 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:05:43,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:05:43,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:05:43,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:05:43,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:05:43,871 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:05:43,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:05:43,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:05:43,871 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:05:43,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:05:43,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:05:43,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:05:43,947 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:05:43,947 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:05:43,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:05:44,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/331db0163/65b9cf2a6ae54a50ac9e0be82ca0280a/FLAGc1a6d3566 [2019-09-10 07:05:44,941 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:05:44,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:05:45,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/331db0163/65b9cf2a6ae54a50ac9e0be82ca0280a/FLAGc1a6d3566 [2019-09-10 07:05:45,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/331db0163/65b9cf2a6ae54a50ac9e0be82ca0280a [2019-09-10 07:05:45,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:05:45,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:05:45,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:05:45,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:05:45,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:05:45,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:05:45" (1/1) ... [2019-09-10 07:05:45,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74484fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:45, skipping insertion in model container [2019-09-10 07:05:45,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:05:45" (1/1) ... [2019-09-10 07:05:45,371 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:05:45,713 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:05:48,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:05:48,215 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:05:49,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:05:49,766 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:05:49,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49 WrapperNode [2019-09-10 07:05:49,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:05:49,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:05:49,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:05:49,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:05:49,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (1/1) ... [2019-09-10 07:05:49,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (1/1) ... [2019-09-10 07:05:49,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (1/1) ... [2019-09-10 07:05:49,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (1/1) ... [2019-09-10 07:05:50,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (1/1) ... [2019-09-10 07:05:50,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (1/1) ... [2019-09-10 07:05:50,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (1/1) ... [2019-09-10 07:05:50,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:05:50,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:05:50,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:05:50,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:05:50,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (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-10 07:05:50,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:05:50,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:05:50,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:05:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:05:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:05:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:05:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:05:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:05:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:05:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:05:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:05:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:05:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:05:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:05:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:05:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:05:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:05:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:05:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:05:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:05:59,196 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:05:59,197 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:05:59,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:05:59 BoogieIcfgContainer [2019-09-10 07:05:59,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:05:59,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:05:59,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:05:59,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:05:59,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:05:45" (1/3) ... [2019-09-10 07:05:59,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f25ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:05:59, skipping insertion in model container [2019-09-10 07:05:59,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:49" (2/3) ... [2019-09-10 07:05:59,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f25ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:05:59, skipping insertion in model container [2019-09-10 07:05:59,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:05:59" (3/3) ... [2019-09-10 07:05:59,211 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:05:59,221 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:05:59,232 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:05:59,250 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:05:59,280 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:05:59,280 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:05:59,280 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:05:59,280 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:05:59,281 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:05:59,281 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:05:59,281 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:05:59,281 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:05:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states. [2019-09-10 07:05:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:05:59,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:59,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:59,385 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash -603174102, now seen corresponding path program 1 times [2019-09-10 07:05:59,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:59,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:59,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:59,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:00,519 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-10 07:06:00,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:00,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:00,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:00,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:00,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:00,545 INFO L87 Difference]: Start difference. First operand 2880 states. Second operand 3 states. [2019-09-10 07:06:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:00,856 INFO L93 Difference]: Finished difference Result 3136 states and 5901 transitions. [2019-09-10 07:06:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:00,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:06:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:00,890 INFO L225 Difference]: With dead ends: 3136 [2019-09-10 07:06:00,890 INFO L226 Difference]: Without dead ends: 3128 [2019-09-10 07:06:00,892 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-10 07:06:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2019-09-10 07:06:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3126. [2019-09-10 07:06:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2019-09-10 07:06:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4014 transitions. [2019-09-10 07:06:01,059 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4014 transitions. Word has length 83 [2019-09-10 07:06:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:01,060 INFO L475 AbstractCegarLoop]: Abstraction has 3126 states and 4014 transitions. [2019-09-10 07:06:01,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4014 transitions. [2019-09-10 07:06:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:06:01,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:01,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:01,082 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:01,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1620390027, now seen corresponding path program 1 times [2019-09-10 07:06:01,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:01,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:01,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:01,522 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-10 07:06:01,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:01,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:01,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:01,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:01,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:01,526 INFO L87 Difference]: Start difference. First operand 3126 states and 4014 transitions. Second operand 3 states. [2019-09-10 07:06:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:02,073 INFO L93 Difference]: Finished difference Result 3620 states and 4717 transitions. [2019-09-10 07:06:02,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:02,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:06:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:02,093 INFO L225 Difference]: With dead ends: 3620 [2019-09-10 07:06:02,093 INFO L226 Difference]: Without dead ends: 3620 [2019-09-10 07:06:02,095 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-10 07:06:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2019-09-10 07:06:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3618. [2019-09-10 07:06:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-09-10 07:06:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4716 transitions. [2019-09-10 07:06:02,205 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4716 transitions. Word has length 83 [2019-09-10 07:06:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:02,209 INFO L475 AbstractCegarLoop]: Abstraction has 3618 states and 4716 transitions. [2019-09-10 07:06:02,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4716 transitions. [2019-09-10 07:06:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:06:02,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:02,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:02,231 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:02,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:02,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1718910594, now seen corresponding path program 1 times [2019-09-10 07:06:02,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:02,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:02,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:02,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:02,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:02,623 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-10 07:06:02,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:02,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:02,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:02,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:02,625 INFO L87 Difference]: Start difference. First operand 3618 states and 4716 transitions. Second operand 5 states. [2019-09-10 07:06:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:04,435 INFO L93 Difference]: Finished difference Result 3526 states and 4765 transitions. [2019-09-10 07:06:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:04,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 07:06:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:04,454 INFO L225 Difference]: With dead ends: 3526 [2019-09-10 07:06:04,454 INFO L226 Difference]: Without dead ends: 3526 [2019-09-10 07:06:04,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2019-09-10 07:06:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 3524. [2019-09-10 07:06:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-09-10 07:06:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4764 transitions. [2019-09-10 07:06:04,549 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4764 transitions. Word has length 83 [2019-09-10 07:06:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:04,550 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 4764 transitions. [2019-09-10 07:06:04,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4764 transitions. [2019-09-10 07:06:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:06:04,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:04,561 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-10 07:06:04,562 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1561724747, now seen corresponding path program 1 times [2019-09-10 07:06:04,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:04,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:04,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:04,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:04,953 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-10 07:06:04,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:04,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:06:04,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:04,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:06:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:06:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:06:04,955 INFO L87 Difference]: Start difference. First operand 3524 states and 4764 transitions. Second operand 6 states. [2019-09-10 07:06:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:06,390 INFO L93 Difference]: Finished difference Result 5436 states and 7666 transitions. [2019-09-10 07:06:06,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:06,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:06:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:06,416 INFO L225 Difference]: With dead ends: 5436 [2019-09-10 07:06:06,416 INFO L226 Difference]: Without dead ends: 5436 [2019-09-10 07:06:06,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:06:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2019-09-10 07:06:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5432. [2019-09-10 07:06:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5432 states. [2019-09-10 07:06:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5432 states to 5432 states and 7664 transitions. [2019-09-10 07:06:06,538 INFO L78 Accepts]: Start accepts. Automaton has 5432 states and 7664 transitions. Word has length 84 [2019-09-10 07:06:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:06,539 INFO L475 AbstractCegarLoop]: Abstraction has 5432 states and 7664 transitions. [2019-09-10 07:06:06,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:06:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5432 states and 7664 transitions. [2019-09-10 07:06:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:06:06,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:06,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:06,554 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2054514782, now seen corresponding path program 1 times [2019-09-10 07:06:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:06,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:06,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:06,824 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-10 07:06:06,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:06,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:06,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:06,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:06,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:06,826 INFO L87 Difference]: Start difference. First operand 5432 states and 7664 transitions. Second operand 5 states. [2019-09-10 07:06:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:08,315 INFO L93 Difference]: Finished difference Result 6550 states and 9203 transitions. [2019-09-10 07:06:08,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:08,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:06:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:08,353 INFO L225 Difference]: With dead ends: 6550 [2019-09-10 07:06:08,353 INFO L226 Difference]: Without dead ends: 6550 [2019-09-10 07:06:08,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2019-09-10 07:06:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6536. [2019-09-10 07:06:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-10 07:06:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 9190 transitions. [2019-09-10 07:06:08,484 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 9190 transitions. Word has length 85 [2019-09-10 07:06:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:08,485 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 9190 transitions. [2019-09-10 07:06:08,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 9190 transitions. [2019-09-10 07:06:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:06:08,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:08,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:08,501 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -916306546, now seen corresponding path program 1 times [2019-09-10 07:06:08,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:08,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:08,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:08,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:08,741 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-10 07:06:08,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:08,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:08,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:08,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:08,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:08,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:08,743 INFO L87 Difference]: Start difference. First operand 6536 states and 9190 transitions. Second operand 3 states. [2019-09-10 07:06:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:08,820 INFO L93 Difference]: Finished difference Result 9506 states and 13337 transitions. [2019-09-10 07:06:08,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:08,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:06:08,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:08,857 INFO L225 Difference]: With dead ends: 9506 [2019-09-10 07:06:08,858 INFO L226 Difference]: Without dead ends: 9506 [2019-09-10 07:06:08,858 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-10 07:06:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9506 states. [2019-09-10 07:06:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9506 to 9480. [2019-09-10 07:06:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9480 states. [2019-09-10 07:06:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9480 states to 9480 states and 13312 transitions. [2019-09-10 07:06:09,014 INFO L78 Accepts]: Start accepts. Automaton has 9480 states and 13312 transitions. Word has length 85 [2019-09-10 07:06:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:09,014 INFO L475 AbstractCegarLoop]: Abstraction has 9480 states and 13312 transitions. [2019-09-10 07:06:09,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states and 13312 transitions. [2019-09-10 07:06:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:06:09,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:09,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:09,027 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2114238153, now seen corresponding path program 1 times [2019-09-10 07:06:09,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:09,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:09,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:09,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:09,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:09,270 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-10 07:06:09,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:09,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:09,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:09,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:09,272 INFO L87 Difference]: Start difference. First operand 9480 states and 13312 transitions. Second operand 3 states. [2019-09-10 07:06:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:09,356 INFO L93 Difference]: Finished difference Result 16606 states and 23297 transitions. [2019-09-10 07:06:09,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:09,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:06:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:09,392 INFO L225 Difference]: With dead ends: 16606 [2019-09-10 07:06:09,392 INFO L226 Difference]: Without dead ends: 16606 [2019-09-10 07:06:09,392 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-10 07:06:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16606 states. [2019-09-10 07:06:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16606 to 16574. [2019-09-10 07:06:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16574 states. [2019-09-10 07:06:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16574 states to 16574 states and 23266 transitions. [2019-09-10 07:06:09,785 INFO L78 Accepts]: Start accepts. Automaton has 16574 states and 23266 transitions. Word has length 85 [2019-09-10 07:06:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:09,785 INFO L475 AbstractCegarLoop]: Abstraction has 16574 states and 23266 transitions. [2019-09-10 07:06:09,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16574 states and 23266 transitions. [2019-09-10 07:06:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:06:09,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:09,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:09,805 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:09,805 INFO L82 PathProgramCache]: Analyzing trace with hash 928058945, now seen corresponding path program 1 times [2019-09-10 07:06:09,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:09,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:09,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:09,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:09,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:10,042 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-10 07:06:10,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:10,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:10,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:10,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:10,045 INFO L87 Difference]: Start difference. First operand 16574 states and 23266 transitions. Second operand 5 states. [2019-09-10 07:06:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:11,204 INFO L93 Difference]: Finished difference Result 27363 states and 38853 transitions. [2019-09-10 07:06:11,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:11,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:06:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:11,271 INFO L225 Difference]: With dead ends: 27363 [2019-09-10 07:06:11,271 INFO L226 Difference]: Without dead ends: 27363 [2019-09-10 07:06:11,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27363 states. [2019-09-10 07:06:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27363 to 27361. [2019-09-10 07:06:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27361 states. [2019-09-10 07:06:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27361 states to 27361 states and 38852 transitions. [2019-09-10 07:06:11,690 INFO L78 Accepts]: Start accepts. Automaton has 27361 states and 38852 transitions. Word has length 85 [2019-09-10 07:06:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:11,691 INFO L475 AbstractCegarLoop]: Abstraction has 27361 states and 38852 transitions. [2019-09-10 07:06:11,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 27361 states and 38852 transitions. [2019-09-10 07:06:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:06:11,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:11,717 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-10 07:06:11,718 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1383795896, now seen corresponding path program 1 times [2019-09-10 07:06:11,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:11,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:11,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:11,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:11,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:12,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:12,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:12,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:12,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:12,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:12,133 INFO L87 Difference]: Start difference. First operand 27361 states and 38852 transitions. Second operand 3 states. [2019-09-10 07:06:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:12,273 INFO L93 Difference]: Finished difference Result 38211 states and 53414 transitions. [2019-09-10 07:06:12,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:12,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:06:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:12,348 INFO L225 Difference]: With dead ends: 38211 [2019-09-10 07:06:12,348 INFO L226 Difference]: Without dead ends: 38211 [2019-09-10 07:06:12,349 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-10 07:06:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38211 states. [2019-09-10 07:06:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38211 to 38089. [2019-09-10 07:06:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38089 states. [2019-09-10 07:06:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38089 states to 38089 states and 53293 transitions. [2019-09-10 07:06:12,874 INFO L78 Accepts]: Start accepts. Automaton has 38089 states and 53293 transitions. Word has length 86 [2019-09-10 07:06:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:12,875 INFO L475 AbstractCegarLoop]: Abstraction has 38089 states and 53293 transitions. [2019-09-10 07:06:12,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38089 states and 53293 transitions. [2019-09-10 07:06:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:06:12,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:12,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:12,911 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:12,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2015781570, now seen corresponding path program 1 times [2019-09-10 07:06:12,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:12,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:12,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:13,195 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-10 07:06:13,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:13,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:13,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:13,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:13,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:13,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:13,199 INFO L87 Difference]: Start difference. First operand 38089 states and 53293 transitions. Second operand 5 states. [2019-09-10 07:06:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:14,482 INFO L93 Difference]: Finished difference Result 52651 states and 73406 transitions. [2019-09-10 07:06:14,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:14,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:06:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:14,557 INFO L225 Difference]: With dead ends: 52651 [2019-09-10 07:06:14,559 INFO L226 Difference]: Without dead ends: 52651 [2019-09-10 07:06:14,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52651 states. [2019-09-10 07:06:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52651 to 52469. [2019-09-10 07:06:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52469 states. [2019-09-10 07:06:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52469 states to 52469 states and 73225 transitions. [2019-09-10 07:06:15,135 INFO L78 Accepts]: Start accepts. Automaton has 52469 states and 73225 transitions. Word has length 87 [2019-09-10 07:06:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:15,135 INFO L475 AbstractCegarLoop]: Abstraction has 52469 states and 73225 transitions. [2019-09-10 07:06:15,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 52469 states and 73225 transitions. [2019-09-10 07:06:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:06:15,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:15,161 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-10 07:06:15,161 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:15,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:15,162 INFO L82 PathProgramCache]: Analyzing trace with hash 57766554, now seen corresponding path program 1 times [2019-09-10 07:06:15,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:15,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:15,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:15,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:15,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:15,455 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-10 07:06:15,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:15,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:15,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:15,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:15,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:15,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:15,456 INFO L87 Difference]: Start difference. First operand 52469 states and 73225 transitions. Second operand 7 states. [2019-09-10 07:06:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:17,944 INFO L93 Difference]: Finished difference Result 225206 states and 318027 transitions. [2019-09-10 07:06:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:06:17,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:06:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:18,276 INFO L225 Difference]: With dead ends: 225206 [2019-09-10 07:06:18,276 INFO L226 Difference]: Without dead ends: 225206 [2019-09-10 07:06:18,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:06:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225206 states. [2019-09-10 07:06:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225206 to 52781. [2019-09-10 07:06:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52781 states. [2019-09-10 07:06:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52781 states to 52781 states and 73637 transitions. [2019-09-10 07:06:22,058 INFO L78 Accepts]: Start accepts. Automaton has 52781 states and 73637 transitions. Word has length 88 [2019-09-10 07:06:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:22,058 INFO L475 AbstractCegarLoop]: Abstraction has 52781 states and 73637 transitions. [2019-09-10 07:06:22,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 52781 states and 73637 transitions. [2019-09-10 07:06:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:06:22,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:22,077 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-10 07:06:22,077 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash -811257953, now seen corresponding path program 1 times [2019-09-10 07:06:22,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:22,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:22,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:22,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:22,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:22,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:22,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:22,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:22,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:22,358 INFO L87 Difference]: Start difference. First operand 52781 states and 73637 transitions. Second operand 7 states. [2019-09-10 07:06:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:25,231 INFO L93 Difference]: Finished difference Result 221760 states and 312385 transitions. [2019-09-10 07:06:25,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:06:25,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:06:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:25,562 INFO L225 Difference]: With dead ends: 221760 [2019-09-10 07:06:25,562 INFO L226 Difference]: Without dead ends: 221760 [2019-09-10 07:06:25,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:06:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221760 states. [2019-09-10 07:06:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221760 to 53445. [2019-09-10 07:06:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53445 states. [2019-09-10 07:06:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53445 states to 53445 states and 74521 transitions. [2019-09-10 07:06:29,095 INFO L78 Accepts]: Start accepts. Automaton has 53445 states and 74521 transitions. Word has length 88 [2019-09-10 07:06:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:29,095 INFO L475 AbstractCegarLoop]: Abstraction has 53445 states and 74521 transitions. [2019-09-10 07:06:29,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 53445 states and 74521 transitions. [2019-09-10 07:06:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:06:29,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:29,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:29,118 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash 270537802, now seen corresponding path program 1 times [2019-09-10 07:06:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:29,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:29,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:29,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:29,391 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-10 07:06:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:29,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:29,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:29,393 INFO L87 Difference]: Start difference. First operand 53445 states and 74521 transitions. Second operand 7 states. [2019-09-10 07:06:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:31,818 INFO L93 Difference]: Finished difference Result 271398 states and 384307 transitions. [2019-09-10 07:06:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:06:31,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:06:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:32,892 INFO L225 Difference]: With dead ends: 271398 [2019-09-10 07:06:32,892 INFO L226 Difference]: Without dead ends: 271398 [2019-09-10 07:06:32,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:06:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271398 states. [2019-09-10 07:06:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271398 to 53615. [2019-09-10 07:06:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53615 states. [2019-09-10 07:06:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53615 states to 53615 states and 74741 transitions. [2019-09-10 07:06:37,279 INFO L78 Accepts]: Start accepts. Automaton has 53615 states and 74741 transitions. Word has length 88 [2019-09-10 07:06:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:37,280 INFO L475 AbstractCegarLoop]: Abstraction has 53615 states and 74741 transitions. [2019-09-10 07:06:37,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 53615 states and 74741 transitions. [2019-09-10 07:06:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:06:37,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:37,302 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-10 07:06:37,303 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -252688091, now seen corresponding path program 1 times [2019-09-10 07:06:37,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:37,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:37,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:37,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:37,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:37,567 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-10 07:06:37,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:37,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:37,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:37,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:37,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:37,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:37,570 INFO L87 Difference]: Start difference. First operand 53615 states and 74741 transitions. Second operand 7 states. [2019-09-10 07:06:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:39,650 INFO L93 Difference]: Finished difference Result 173854 states and 243928 transitions. [2019-09-10 07:06:39,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:06:39,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:06:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:39,872 INFO L225 Difference]: With dead ends: 173854 [2019-09-10 07:06:39,872 INFO L226 Difference]: Without dead ends: 173854 [2019-09-10 07:06:39,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:06:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173854 states. [2019-09-10 07:06:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173854 to 53699. [2019-09-10 07:06:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53699 states. [2019-09-10 07:06:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53699 states to 53699 states and 74849 transitions. [2019-09-10 07:06:41,610 INFO L78 Accepts]: Start accepts. Automaton has 53699 states and 74849 transitions. Word has length 88 [2019-09-10 07:06:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:41,611 INFO L475 AbstractCegarLoop]: Abstraction has 53699 states and 74849 transitions. [2019-09-10 07:06:41,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 53699 states and 74849 transitions. [2019-09-10 07:06:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:06:41,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:41,634 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-10 07:06:41,635 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash -469974282, now seen corresponding path program 1 times [2019-09-10 07:06:41,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:41,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:41,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:41,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:41,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:41,901 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-10 07:06:41,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:41,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:41,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:41,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:41,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:41,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:41,903 INFO L87 Difference]: Start difference. First operand 53699 states and 74849 transitions. Second operand 7 states. [2019-09-10 07:06:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:44,493 INFO L93 Difference]: Finished difference Result 196197 states and 275506 transitions. [2019-09-10 07:06:44,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:06:44,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:06:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:44,757 INFO L225 Difference]: With dead ends: 196197 [2019-09-10 07:06:44,757 INFO L226 Difference]: Without dead ends: 196197 [2019-09-10 07:06:44,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:06:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196197 states. [2019-09-10 07:06:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196197 to 53990. [2019-09-10 07:06:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53990 states. [2019-09-10 07:06:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53990 states to 53990 states and 75250 transitions. [2019-09-10 07:06:46,568 INFO L78 Accepts]: Start accepts. Automaton has 53990 states and 75250 transitions. Word has length 88 [2019-09-10 07:06:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:46,568 INFO L475 AbstractCegarLoop]: Abstraction has 53990 states and 75250 transitions. [2019-09-10 07:06:46,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 53990 states and 75250 transitions. [2019-09-10 07:06:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:06:46,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:46,589 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-10 07:06:46,589 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1872353157, now seen corresponding path program 1 times [2019-09-10 07:06:46,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:46,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:46,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:46,975 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-10 07:06:46,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:46,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:06:46,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:46,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:06:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:06:46,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:06:46,979 INFO L87 Difference]: Start difference. First operand 53990 states and 75250 transitions. Second operand 8 states. [2019-09-10 07:06:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:49,812 INFO L93 Difference]: Finished difference Result 168438 states and 238549 transitions. [2019-09-10 07:06:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:06:49,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-09-10 07:06:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:50,013 INFO L225 Difference]: With dead ends: 168438 [2019-09-10 07:06:50,013 INFO L226 Difference]: Without dead ends: 168438 [2019-09-10 07:06:50,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:06:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168438 states. [2019-09-10 07:06:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168438 to 52510. [2019-09-10 07:06:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52510 states. [2019-09-10 07:06:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52510 states to 52510 states and 73201 transitions. [2019-09-10 07:06:51,355 INFO L78 Accepts]: Start accepts. Automaton has 52510 states and 73201 transitions. Word has length 89 [2019-09-10 07:06:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:51,355 INFO L475 AbstractCegarLoop]: Abstraction has 52510 states and 73201 transitions. [2019-09-10 07:06:51,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:06:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 52510 states and 73201 transitions. [2019-09-10 07:06:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:06:51,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:51,369 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-10 07:06:51,370 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1507959810, now seen corresponding path program 1 times [2019-09-10 07:06:51,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:51,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:51,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:51,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:51,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:51,705 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-10 07:06:51,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:51,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:06:51,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:51,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:06:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:06:51,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:06:51,707 INFO L87 Difference]: Start difference. First operand 52510 states and 73201 transitions. Second operand 9 states. [2019-09-10 07:06:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:55,395 INFO L93 Difference]: Finished difference Result 196777 states and 278761 transitions. [2019-09-10 07:06:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:06:55,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:06:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:55,664 INFO L225 Difference]: With dead ends: 196777 [2019-09-10 07:06:55,664 INFO L226 Difference]: Without dead ends: 196777 [2019-09-10 07:06:55,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:06:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196777 states. [2019-09-10 07:06:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196777 to 52478. [2019-09-10 07:06:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52478 states. [2019-09-10 07:06:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52478 states to 52478 states and 73141 transitions. [2019-09-10 07:06:57,659 INFO L78 Accepts]: Start accepts. Automaton has 52478 states and 73141 transitions. Word has length 89 [2019-09-10 07:06:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:57,659 INFO L475 AbstractCegarLoop]: Abstraction has 52478 states and 73141 transitions. [2019-09-10 07:06:57,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:06:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 52478 states and 73141 transitions. [2019-09-10 07:06:57,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:06:57,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:57,678 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-10 07:06:57,678 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:57,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:57,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1558975788, now seen corresponding path program 1 times [2019-09-10 07:06:57,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:57,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:57,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:57,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:57,928 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-10 07:06:57,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:57,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:57,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:57,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:57,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:57,930 INFO L87 Difference]: Start difference. First operand 52478 states and 73141 transitions. Second operand 7 states. [2019-09-10 07:07:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:00,396 INFO L93 Difference]: Finished difference Result 222809 states and 314945 transitions. [2019-09-10 07:07:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:00,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:07:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:00,684 INFO L225 Difference]: With dead ends: 222809 [2019-09-10 07:07:00,684 INFO L226 Difference]: Without dead ends: 222809 [2019-09-10 07:07:00,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:07:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222809 states. [2019-09-10 07:07:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222809 to 52553. [2019-09-10 07:07:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52553 states. [2019-09-10 07:07:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52553 states to 52553 states and 73241 transitions. [2019-09-10 07:07:02,535 INFO L78 Accepts]: Start accepts. Automaton has 52553 states and 73241 transitions. Word has length 89 [2019-09-10 07:07:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:02,535 INFO L475 AbstractCegarLoop]: Abstraction has 52553 states and 73241 transitions. [2019-09-10 07:07:02,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 52553 states and 73241 transitions. [2019-09-10 07:07:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:07:02,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:02,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:07:02,552 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:02,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:02,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1906086959, now seen corresponding path program 1 times [2019-09-10 07:07:02,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:02,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:02,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:02,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:02,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:02,779 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-10 07:07:02,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:02,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:02,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:02,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:02,782 INFO L87 Difference]: Start difference. First operand 52553 states and 73241 transitions. Second operand 7 states. [2019-09-10 07:07:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:05,097 INFO L93 Difference]: Finished difference Result 219292 states and 309248 transitions. [2019-09-10 07:07:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:05,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:07:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:05,366 INFO L225 Difference]: With dead ends: 219292 [2019-09-10 07:07:05,366 INFO L226 Difference]: Without dead ends: 219292 [2019-09-10 07:07:05,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:07:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219292 states. [2019-09-10 07:07:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219292 to 52701. [2019-09-10 07:07:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52701 states. [2019-09-10 07:07:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52701 states to 52701 states and 73439 transitions. [2019-09-10 07:07:07,102 INFO L78 Accepts]: Start accepts. Automaton has 52701 states and 73439 transitions. Word has length 89 [2019-09-10 07:07:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:07,103 INFO L475 AbstractCegarLoop]: Abstraction has 52701 states and 73439 transitions. [2019-09-10 07:07:07,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 52701 states and 73439 transitions. [2019-09-10 07:07:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:07:07,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:07,117 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-10 07:07:07,117 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:07,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:07,117 INFO L82 PathProgramCache]: Analyzing trace with hash 317477170, now seen corresponding path program 1 times [2019-09-10 07:07:07,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:07,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:07,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:07,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:07,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:07,370 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-10 07:07:07,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:07,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:07:07,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:07,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:07:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:07:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:07,372 INFO L87 Difference]: Start difference. First operand 52701 states and 73439 transitions. Second operand 9 states. [2019-09-10 07:07:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:10,669 INFO L93 Difference]: Finished difference Result 182398 states and 258365 transitions. [2019-09-10 07:07:10,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:07:10,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:07:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:10,880 INFO L225 Difference]: With dead ends: 182398 [2019-09-10 07:07:10,880 INFO L226 Difference]: Without dead ends: 182398 [2019-09-10 07:07:10,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:07:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182398 states. [2019-09-10 07:07:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182398 to 52127. [2019-09-10 07:07:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52127 states. [2019-09-10 07:07:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52127 states to 52127 states and 72656 transitions. [2019-09-10 07:07:12,667 INFO L78 Accepts]: Start accepts. Automaton has 52127 states and 72656 transitions. Word has length 89 [2019-09-10 07:07:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:12,668 INFO L475 AbstractCegarLoop]: Abstraction has 52127 states and 72656 transitions. [2019-09-10 07:07:12,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:07:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 52127 states and 72656 transitions. [2019-09-10 07:07:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:07:12,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:12,683 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-10 07:07:12,683 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1988876191, now seen corresponding path program 1 times [2019-09-10 07:07:12,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:12,973 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-10 07:07:12,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:12,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:07:12,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:12,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:07:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:07:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:12,976 INFO L87 Difference]: Start difference. First operand 52127 states and 72656 transitions. Second operand 9 states. [2019-09-10 07:07:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:16,197 INFO L93 Difference]: Finished difference Result 197927 states and 282509 transitions. [2019-09-10 07:07:16,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:07:16,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:07:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:16,436 INFO L225 Difference]: With dead ends: 197927 [2019-09-10 07:07:16,436 INFO L226 Difference]: Without dead ends: 197927 [2019-09-10 07:07:16,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:07:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197927 states. [2019-09-10 07:07:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197927 to 52041. [2019-09-10 07:07:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52041 states. [2019-09-10 07:07:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52041 states to 52041 states and 72532 transitions. [2019-09-10 07:07:18,231 INFO L78 Accepts]: Start accepts. Automaton has 52041 states and 72532 transitions. Word has length 89 [2019-09-10 07:07:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:18,231 INFO L475 AbstractCegarLoop]: Abstraction has 52041 states and 72532 transitions. [2019-09-10 07:07:18,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:07:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 52041 states and 72532 transitions. [2019-09-10 07:07:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:07:18,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:18,246 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-10 07:07:18,246 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:18,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:18,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1526338783, now seen corresponding path program 1 times [2019-09-10 07:07:18,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:18,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:18,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:18,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:18,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:18,457 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-10 07:07:18,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:18,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:18,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:18,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:18,459 INFO L87 Difference]: Start difference. First operand 52041 states and 72532 transitions. Second operand 7 states. [2019-09-10 07:07:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:20,819 INFO L93 Difference]: Finished difference Result 218526 states and 308204 transitions. [2019-09-10 07:07:20,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:20,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:07:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:21,091 INFO L225 Difference]: With dead ends: 218526 [2019-09-10 07:07:21,091 INFO L226 Difference]: Without dead ends: 218526 [2019-09-10 07:07:21,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:07:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218526 states. [2019-09-10 07:07:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218526 to 52146. [2019-09-10 07:07:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52146 states. [2019-09-10 07:07:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52146 states to 52146 states and 72672 transitions. [2019-09-10 07:07:23,073 INFO L78 Accepts]: Start accepts. Automaton has 52146 states and 72672 transitions. Word has length 89 [2019-09-10 07:07:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:23,073 INFO L475 AbstractCegarLoop]: Abstraction has 52146 states and 72672 transitions. [2019-09-10 07:07:23,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 52146 states and 72672 transitions. [2019-09-10 07:07:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:07:23,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:23,088 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-10 07:07:23,089 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:23,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1963014080, now seen corresponding path program 1 times [2019-09-10 07:07:23,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:23,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:23,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:23,351 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-10 07:07:23,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:23,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:07:23,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:23,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:07:23,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:07:23,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:23,353 INFO L87 Difference]: Start difference. First operand 52146 states and 72672 transitions. Second operand 9 states. [2019-09-10 07:07:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:27,007 INFO L93 Difference]: Finished difference Result 196894 states and 279036 transitions. [2019-09-10 07:07:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:07:27,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:07:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:27,274 INFO L225 Difference]: With dead ends: 196894 [2019-09-10 07:07:27,275 INFO L226 Difference]: Without dead ends: 196894 [2019-09-10 07:07:27,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:07:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196894 states. [2019-09-10 07:07:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196894 to 52087. [2019-09-10 07:07:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52087 states. [2019-09-10 07:07:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52087 states to 52087 states and 72583 transitions. [2019-09-10 07:07:28,621 INFO L78 Accepts]: Start accepts. Automaton has 52087 states and 72583 transitions. Word has length 89 [2019-09-10 07:07:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:28,621 INFO L475 AbstractCegarLoop]: Abstraction has 52087 states and 72583 transitions. [2019-09-10 07:07:28,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:07:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 52087 states and 72583 transitions. [2019-09-10 07:07:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:07:28,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:28,636 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-10 07:07:28,636 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1093801911, now seen corresponding path program 1 times [2019-09-10 07:07:28,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:28,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:28,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:29,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:29,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:07:29,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:29,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:07:29,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:07:29,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:07:29,736 INFO L87 Difference]: Start difference. First operand 52087 states and 72583 transitions. Second operand 15 states. [2019-09-10 07:07:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:36,218 INFO L93 Difference]: Finished difference Result 436946 states and 623744 transitions. [2019-09-10 07:07:36,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:07:36,219 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-09-10 07:07:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:36,927 INFO L225 Difference]: With dead ends: 436946 [2019-09-10 07:07:36,927 INFO L226 Difference]: Without dead ends: 436946 [2019-09-10 07:07:36,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:07:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436946 states. [2019-09-10 07:07:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436946 to 52051. [2019-09-10 07:07:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52051 states. [2019-09-10 07:07:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52051 states to 52051 states and 72511 transitions. [2019-09-10 07:07:39,931 INFO L78 Accepts]: Start accepts. Automaton has 52051 states and 72511 transitions. Word has length 90 [2019-09-10 07:07:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:39,932 INFO L475 AbstractCegarLoop]: Abstraction has 52051 states and 72511 transitions. [2019-09-10 07:07:39,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:07:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 52051 states and 72511 transitions. [2019-09-10 07:07:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:07:39,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:39,948 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-10 07:07:39,948 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:39,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1435232020, now seen corresponding path program 1 times [2019-09-10 07:07:39,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:39,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:39,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:39,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:39,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:40,200 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-10 07:07:40,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:40,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:40,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:40,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:40,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:40,202 INFO L87 Difference]: Start difference. First operand 52051 states and 72511 transitions. Second operand 7 states. [2019-09-10 07:07:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:42,704 INFO L93 Difference]: Finished difference Result 194072 states and 272541 transitions. [2019-09-10 07:07:42,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:42,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:07:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:42,936 INFO L225 Difference]: With dead ends: 194072 [2019-09-10 07:07:42,937 INFO L226 Difference]: Without dead ends: 194072 [2019-09-10 07:07:42,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:07:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194072 states. [2019-09-10 07:07:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194072 to 52364. [2019-09-10 07:07:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52364 states. [2019-09-10 07:07:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52364 states to 52364 states and 72949 transitions. [2019-09-10 07:07:44,684 INFO L78 Accepts]: Start accepts. Automaton has 52364 states and 72949 transitions. Word has length 90 [2019-09-10 07:07:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:44,684 INFO L475 AbstractCegarLoop]: Abstraction has 52364 states and 72949 transitions. [2019-09-10 07:07:44,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 52364 states and 72949 transitions. [2019-09-10 07:07:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:07:44,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:44,700 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-10 07:07:44,701 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash 167167852, now seen corresponding path program 1 times [2019-09-10 07:07:44,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:44,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:44,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:44,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:44,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:45,273 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-10 07:07:45,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:45,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:07:45,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:45,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:07:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:07:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:07:45,275 INFO L87 Difference]: Start difference. First operand 52364 states and 72949 transitions. Second operand 12 states. [2019-09-10 07:07:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:47,384 INFO L93 Difference]: Finished difference Result 201160 states and 285962 transitions. [2019-09-10 07:07:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:07:47,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 07:07:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:47,644 INFO L225 Difference]: With dead ends: 201160 [2019-09-10 07:07:47,644 INFO L226 Difference]: Without dead ends: 201160 [2019-09-10 07:07:47,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:07:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201160 states. [2019-09-10 07:07:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201160 to 50587. [2019-09-10 07:07:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50587 states. [2019-09-10 07:07:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50587 states to 50587 states and 70623 transitions. [2019-09-10 07:07:49,188 INFO L78 Accepts]: Start accepts. Automaton has 50587 states and 70623 transitions. Word has length 90 [2019-09-10 07:07:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:49,189 INFO L475 AbstractCegarLoop]: Abstraction has 50587 states and 70623 transitions. [2019-09-10 07:07:49,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:07:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 50587 states and 70623 transitions. [2019-09-10 07:07:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:07:49,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:49,202 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-10 07:07:49,202 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:49,202 INFO L82 PathProgramCache]: Analyzing trace with hash -888042215, now seen corresponding path program 1 times [2019-09-10 07:07:49,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:49,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:49,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:49,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:49,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:50,457 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-10 07:07:50,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:50,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:07:50,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:50,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:07:50,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:07:50,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:07:50,459 INFO L87 Difference]: Start difference. First operand 50587 states and 70623 transitions. Second operand 17 states. [2019-09-10 07:07:50,626 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 07:07:51,220 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 07:07:51,352 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-09-10 07:07:51,612 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 07:07:51,951 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:07:52,719 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 07:07:54,260 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 07:07:54,563 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-09-10 07:07:54,804 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-09-10 07:07:55,141 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 07:07:55,645 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:07:55,966 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-09-10 07:07:56,432 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-10 07:07:56,813 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 07:08:00,876 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:08:01,500 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 07:08:01,815 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:08:02,175 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 07:08:03,353 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 07:08:03,830 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 07:08:04,843 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:08:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:05,382 INFO L93 Difference]: Finished difference Result 537923 states and 769505 transitions. [2019-09-10 07:08:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 07:08:05,383 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 90 [2019-09-10 07:08:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:06,174 INFO L225 Difference]: With dead ends: 537923 [2019-09-10 07:08:06,174 INFO L226 Difference]: Without dead ends: 537923 [2019-09-10 07:08:06,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=646, Invalid=2216, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:08:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537923 states. [2019-09-10 07:08:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537923 to 50623. [2019-09-10 07:08:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50623 states. [2019-09-10 07:08:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50623 states to 50623 states and 70677 transitions. [2019-09-10 07:08:09,925 INFO L78 Accepts]: Start accepts. Automaton has 50623 states and 70677 transitions. Word has length 90 [2019-09-10 07:08:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:09,925 INFO L475 AbstractCegarLoop]: Abstraction has 50623 states and 70677 transitions. [2019-09-10 07:08:09,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:08:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 50623 states and 70677 transitions. [2019-09-10 07:08:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:08:09,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:09,941 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-10 07:08:09,941 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -698943979, now seen corresponding path program 1 times [2019-09-10 07:08:09,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:09,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:09,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:10,497 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-10 07:08:10,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:10,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:08:10,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:10,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:08:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:08:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:08:10,499 INFO L87 Difference]: Start difference. First operand 50623 states and 70677 transitions. Second operand 12 states. [2019-09-10 07:08:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:13,184 INFO L93 Difference]: Finished difference Result 206091 states and 293313 transitions. [2019-09-10 07:08:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:08:13,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 07:08:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:13,428 INFO L225 Difference]: With dead ends: 206091 [2019-09-10 07:08:13,429 INFO L226 Difference]: Without dead ends: 206091 [2019-09-10 07:08:13,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:08:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206091 states. [2019-09-10 07:08:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206091 to 50352. [2019-09-10 07:08:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50352 states. [2019-09-10 07:08:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50352 states to 50352 states and 70297 transitions. [2019-09-10 07:08:14,635 INFO L78 Accepts]: Start accepts. Automaton has 50352 states and 70297 transitions. Word has length 90 [2019-09-10 07:08:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:14,635 INFO L475 AbstractCegarLoop]: Abstraction has 50352 states and 70297 transitions. [2019-09-10 07:08:14,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:08:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 50352 states and 70297 transitions. [2019-09-10 07:08:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:08:14,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:14,649 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-10 07:08:14,650 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:14,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:14,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2050160689, now seen corresponding path program 1 times [2019-09-10 07:08:14,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:14,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:14,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:14,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:14,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:14,817 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-10 07:08:14,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:14,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:14,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:14,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:14,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:14,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:14,819 INFO L87 Difference]: Start difference. First operand 50352 states and 70297 transitions. Second operand 3 states. [2019-09-10 07:08:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:14,989 INFO L93 Difference]: Finished difference Result 50354 states and 69717 transitions. [2019-09-10 07:08:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:14,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:08:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:15,056 INFO L225 Difference]: With dead ends: 50354 [2019-09-10 07:08:15,056 INFO L226 Difference]: Without dead ends: 50354 [2019-09-10 07:08:15,056 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-10 07:08:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50354 states. [2019-09-10 07:08:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50354 to 50352. [2019-09-10 07:08:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50352 states. [2019-09-10 07:08:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50352 states to 50352 states and 69716 transitions. [2019-09-10 07:08:15,610 INFO L78 Accepts]: Start accepts. Automaton has 50352 states and 69716 transitions. Word has length 90 [2019-09-10 07:08:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:15,611 INFO L475 AbstractCegarLoop]: Abstraction has 50352 states and 69716 transitions. [2019-09-10 07:08:15,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 50352 states and 69716 transitions. [2019-09-10 07:08:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:08:15,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:15,629 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-10 07:08:15,629 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash -267434882, now seen corresponding path program 1 times [2019-09-10 07:08:15,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:15,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:15,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:15,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:15,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:16,120 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-10 07:08:16,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:16,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:08:16,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:16,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:08:16,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:08:16,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:08:16,444 INFO L87 Difference]: Start difference. First operand 50352 states and 69716 transitions. Second operand 12 states. [2019-09-10 07:08:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:18,563 INFO L93 Difference]: Finished difference Result 170198 states and 239476 transitions. [2019-09-10 07:08:18,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:08:18,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 07:08:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:18,787 INFO L225 Difference]: With dead ends: 170198 [2019-09-10 07:08:18,788 INFO L226 Difference]: Without dead ends: 170198 [2019-09-10 07:08:18,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:08:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170198 states. [2019-09-10 07:08:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170198 to 48737. [2019-09-10 07:08:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48737 states. [2019-09-10 07:08:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48737 states to 48737 states and 67595 transitions. [2019-09-10 07:08:19,827 INFO L78 Accepts]: Start accepts. Automaton has 48737 states and 67595 transitions. Word has length 90 [2019-09-10 07:08:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:19,828 INFO L475 AbstractCegarLoop]: Abstraction has 48737 states and 67595 transitions. [2019-09-10 07:08:19,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:08:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 48737 states and 67595 transitions. [2019-09-10 07:08:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:08:19,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:19,842 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-10 07:08:19,842 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:19,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1973113769, now seen corresponding path program 1 times [2019-09-10 07:08:19,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:19,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:19,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:19,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:19,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:20,102 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-10 07:08:20,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:20,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:08:20,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:20,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:08:20,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:08:20,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:20,103 INFO L87 Difference]: Start difference. First operand 48737 states and 67595 transitions. Second operand 9 states. [2019-09-10 07:08:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:22,644 INFO L93 Difference]: Finished difference Result 109337 states and 153032 transitions. [2019-09-10 07:08:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:08:22,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-10 07:08:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:22,772 INFO L225 Difference]: With dead ends: 109337 [2019-09-10 07:08:22,772 INFO L226 Difference]: Without dead ends: 109337 [2019-09-10 07:08:22,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:08:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109337 states. [2019-09-10 07:08:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109337 to 48719. [2019-09-10 07:08:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48719 states. [2019-09-10 07:08:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48719 states to 48719 states and 67559 transitions. [2019-09-10 07:08:23,967 INFO L78 Accepts]: Start accepts. Automaton has 48719 states and 67559 transitions. Word has length 91 [2019-09-10 07:08:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:23,968 INFO L475 AbstractCegarLoop]: Abstraction has 48719 states and 67559 transitions. [2019-09-10 07:08:23,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:08:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 48719 states and 67559 transitions. [2019-09-10 07:08:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:08:23,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:23,985 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-10 07:08:23,985 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:23,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:23,986 INFO L82 PathProgramCache]: Analyzing trace with hash 624527724, now seen corresponding path program 1 times [2019-09-10 07:08:23,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:23,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:23,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:24,155 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-10 07:08:24,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:24,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:24,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:24,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:24,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:24,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:24,157 INFO L87 Difference]: Start difference. First operand 48719 states and 67559 transitions. Second operand 3 states. [2019-09-10 07:08:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:24,298 INFO L93 Difference]: Finished difference Result 48721 states and 67066 transitions. [2019-09-10 07:08:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:24,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:08:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:24,348 INFO L225 Difference]: With dead ends: 48721 [2019-09-10 07:08:24,349 INFO L226 Difference]: Without dead ends: 48721 [2019-09-10 07:08:24,349 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-10 07:08:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48721 states. [2019-09-10 07:08:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48721 to 48719. [2019-09-10 07:08:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48719 states. [2019-09-10 07:08:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48719 states to 48719 states and 67065 transitions. [2019-09-10 07:08:24,801 INFO L78 Accepts]: Start accepts. Automaton has 48719 states and 67065 transitions. Word has length 91 [2019-09-10 07:08:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:24,801 INFO L475 AbstractCegarLoop]: Abstraction has 48719 states and 67065 transitions. [2019-09-10 07:08:24,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 48719 states and 67065 transitions. [2019-09-10 07:08:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:08:24,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:24,817 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-10 07:08:24,817 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:24,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1356382409, now seen corresponding path program 1 times [2019-09-10 07:08:24,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:24,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:24,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:24,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:24,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:24,987 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-10 07:08:24,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:24,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:24,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:24,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:24,989 INFO L87 Difference]: Start difference. First operand 48719 states and 67065 transitions. Second operand 3 states. [2019-09-10 07:08:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:25,253 INFO L93 Difference]: Finished difference Result 48721 states and 66487 transitions. [2019-09-10 07:08:25,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:25,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 07:08:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:25,322 INFO L225 Difference]: With dead ends: 48721 [2019-09-10 07:08:25,322 INFO L226 Difference]: Without dead ends: 48721 [2019-09-10 07:08:25,323 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-10 07:08:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48721 states. [2019-09-10 07:08:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48721 to 48719. [2019-09-10 07:08:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48719 states. [2019-09-10 07:08:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48719 states to 48719 states and 66486 transitions. [2019-09-10 07:08:25,800 INFO L78 Accepts]: Start accepts. Automaton has 48719 states and 66486 transitions. Word has length 92 [2019-09-10 07:08:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:25,800 INFO L475 AbstractCegarLoop]: Abstraction has 48719 states and 66486 transitions. [2019-09-10 07:08:25,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 48719 states and 66486 transitions. [2019-09-10 07:08:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:08:25,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:25,816 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-10 07:08:25,816 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1516672996, now seen corresponding path program 1 times [2019-09-10 07:08:25,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:25,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:25,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:25,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:25,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:26,250 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-10 07:08:26,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:26,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:26,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:26,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:26,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:26,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:26,251 INFO L87 Difference]: Start difference. First operand 48719 states and 66486 transitions. Second operand 3 states. [2019-09-10 07:08:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:26,492 INFO L93 Difference]: Finished difference Result 74046 states and 101806 transitions. [2019-09-10 07:08:26,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:26,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 07:08:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:26,575 INFO L225 Difference]: With dead ends: 74046 [2019-09-10 07:08:26,576 INFO L226 Difference]: Without dead ends: 74046 [2019-09-10 07:08:26,576 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-10 07:08:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74046 states. [2019-09-10 07:08:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74046 to 73864. [2019-09-10 07:08:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73864 states. [2019-09-10 07:08:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73864 states to 73864 states and 101625 transitions. [2019-09-10 07:08:27,347 INFO L78 Accepts]: Start accepts. Automaton has 73864 states and 101625 transitions. Word has length 92 [2019-09-10 07:08:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:27,347 INFO L475 AbstractCegarLoop]: Abstraction has 73864 states and 101625 transitions. [2019-09-10 07:08:27,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 73864 states and 101625 transitions. [2019-09-10 07:08:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:08:27,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:27,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:27,365 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:27,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:27,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1681739695, now seen corresponding path program 1 times [2019-09-10 07:08:27,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:27,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:27,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:27,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:27,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:27,490 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-10 07:08:27,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:27,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:27,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:27,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:27,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:27,491 INFO L87 Difference]: Start difference. First operand 73864 states and 101625 transitions. Second operand 3 states. [2019-09-10 07:08:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:27,808 INFO L93 Difference]: Finished difference Result 109496 states and 151624 transitions. [2019-09-10 07:08:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:27,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 07:08:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:27,960 INFO L225 Difference]: With dead ends: 109496 [2019-09-10 07:08:27,960 INFO L226 Difference]: Without dead ends: 109496 [2019-09-10 07:08:27,960 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-10 07:08:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109496 states. [2019-09-10 07:08:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109496 to 73071. [2019-09-10 07:08:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73071 states. [2019-09-10 07:08:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73071 states to 73071 states and 100440 transitions. [2019-09-10 07:08:28,811 INFO L78 Accepts]: Start accepts. Automaton has 73071 states and 100440 transitions. Word has length 92 [2019-09-10 07:08:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:28,811 INFO L475 AbstractCegarLoop]: Abstraction has 73071 states and 100440 transitions. [2019-09-10 07:08:28,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 73071 states and 100440 transitions. [2019-09-10 07:08:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:08:28,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:28,828 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:28,828 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:28,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1284793866, now seen corresponding path program 1 times [2019-09-10 07:08:28,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:28,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:28,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:28,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:28,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:29,060 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-10 07:08:29,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:29,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:08:29,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:29,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:08:29,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:08:29,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:29,062 INFO L87 Difference]: Start difference. First operand 73071 states and 100440 transitions. Second operand 9 states. [2019-09-10 07:08:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:32,130 INFO L93 Difference]: Finished difference Result 190952 states and 264127 transitions. [2019-09-10 07:08:32,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:08:32,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 07:08:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:32,416 INFO L225 Difference]: With dead ends: 190952 [2019-09-10 07:08:32,417 INFO L226 Difference]: Without dead ends: 190952 [2019-09-10 07:08:32,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:08:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190952 states. [2019-09-10 07:08:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190952 to 73037. [2019-09-10 07:08:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73037 states. [2019-09-10 07:08:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73037 states to 73037 states and 100390 transitions. [2019-09-10 07:08:33,840 INFO L78 Accepts]: Start accepts. Automaton has 73037 states and 100390 transitions. Word has length 93 [2019-09-10 07:08:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:33,841 INFO L475 AbstractCegarLoop]: Abstraction has 73037 states and 100390 transitions. [2019-09-10 07:08:33,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:08:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 73037 states and 100390 transitions. [2019-09-10 07:08:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:08:33,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:33,860 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-10 07:08:33,860 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1239454647, now seen corresponding path program 1 times [2019-09-10 07:08:33,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:33,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:33,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:34,602 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-10 07:08:34,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:34,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:08:34,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:34,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:08:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:08:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:08:34,604 INFO L87 Difference]: Start difference. First operand 73037 states and 100390 transitions. Second operand 17 states. [2019-09-10 07:08:35,209 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:08:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:39,185 INFO L93 Difference]: Finished difference Result 181730 states and 252268 transitions. [2019-09-10 07:08:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:08:39,186 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 94 [2019-09-10 07:08:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:39,446 INFO L225 Difference]: With dead ends: 181730 [2019-09-10 07:08:39,447 INFO L226 Difference]: Without dead ends: 181730 [2019-09-10 07:08:39,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:08:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181730 states. [2019-09-10 07:08:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181730 to 73037. [2019-09-10 07:08:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73037 states. [2019-09-10 07:08:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73037 states to 73037 states and 100372 transitions. [2019-09-10 07:08:40,755 INFO L78 Accepts]: Start accepts. Automaton has 73037 states and 100372 transitions. Word has length 94 [2019-09-10 07:08:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:40,755 INFO L475 AbstractCegarLoop]: Abstraction has 73037 states and 100372 transitions. [2019-09-10 07:08:40,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:08:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 73037 states and 100372 transitions. [2019-09-10 07:08:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:08:40,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:40,776 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-10 07:08:40,776 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1742050604, now seen corresponding path program 1 times [2019-09-10 07:08:40,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:40,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:40,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:40,901 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-10 07:08:40,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:40,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:40,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:40,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:40,903 INFO L87 Difference]: Start difference. First operand 73037 states and 100372 transitions. Second operand 3 states. [2019-09-10 07:08:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:41,247 INFO L93 Difference]: Finished difference Result 93146 states and 128173 transitions. [2019-09-10 07:08:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:41,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:08:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:41,355 INFO L225 Difference]: With dead ends: 93146 [2019-09-10 07:08:41,355 INFO L226 Difference]: Without dead ends: 93146 [2019-09-10 07:08:41,355 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-10 07:08:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93146 states. [2019-09-10 07:08:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93146 to 70712. [2019-09-10 07:08:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70712 states. [2019-09-10 07:08:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70712 states to 70712 states and 97240 transitions. [2019-09-10 07:08:42,528 INFO L78 Accepts]: Start accepts. Automaton has 70712 states and 97240 transitions. Word has length 94 [2019-09-10 07:08:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:42,529 INFO L475 AbstractCegarLoop]: Abstraction has 70712 states and 97240 transitions. [2019-09-10 07:08:42,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 70712 states and 97240 transitions. [2019-09-10 07:08:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:08:42,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:42,551 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-10 07:08:42,551 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:42,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2137122064, now seen corresponding path program 1 times [2019-09-10 07:08:42,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:42,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:42,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:42,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:43,174 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-10 07:08:43,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:43,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:08:43,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:43,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:08:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:08:43,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:08:43,176 INFO L87 Difference]: Start difference. First operand 70712 states and 97240 transitions. Second operand 16 states. [2019-09-10 07:08:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:45,871 INFO L93 Difference]: Finished difference Result 96325 states and 132951 transitions. [2019-09-10 07:08:45,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:08:45,872 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-09-10 07:08:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:45,965 INFO L225 Difference]: With dead ends: 96325 [2019-09-10 07:08:45,966 INFO L226 Difference]: Without dead ends: 96325 [2019-09-10 07:08:45,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:08:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96325 states. [2019-09-10 07:08:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96325 to 70418. [2019-09-10 07:08:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70418 states. [2019-09-10 07:08:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70418 states to 70418 states and 96872 transitions. [2019-09-10 07:08:46,654 INFO L78 Accepts]: Start accepts. Automaton has 70418 states and 96872 transitions. Word has length 94 [2019-09-10 07:08:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:46,655 INFO L475 AbstractCegarLoop]: Abstraction has 70418 states and 96872 transitions. [2019-09-10 07:08:46,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:08:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 70418 states and 96872 transitions. [2019-09-10 07:08:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:08:46,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:46,673 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-10 07:08:46,673 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash -903587696, now seen corresponding path program 1 times [2019-09-10 07:08:46,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:46,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:46,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:47,258 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-10 07:08:47,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:47,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:08:47,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:47,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:08:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:08:47,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:08:47,259 INFO L87 Difference]: Start difference. First operand 70418 states and 96872 transitions. Second operand 11 states. [2019-09-10 07:08:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:49,397 INFO L93 Difference]: Finished difference Result 159190 states and 220577 transitions. [2019-09-10 07:08:49,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:08:49,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-09-10 07:08:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:49,601 INFO L225 Difference]: With dead ends: 159190 [2019-09-10 07:08:49,602 INFO L226 Difference]: Without dead ends: 159190 [2019-09-10 07:08:49,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:08:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159190 states. [2019-09-10 07:08:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159190 to 69839. [2019-09-10 07:08:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69839 states. [2019-09-10 07:08:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69839 states to 69839 states and 96164 transitions. [2019-09-10 07:08:50,637 INFO L78 Accepts]: Start accepts. Automaton has 69839 states and 96164 transitions. Word has length 95 [2019-09-10 07:08:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:50,637 INFO L475 AbstractCegarLoop]: Abstraction has 69839 states and 96164 transitions. [2019-09-10 07:08:50,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:08:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 69839 states and 96164 transitions. [2019-09-10 07:08:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:08:50,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:50,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:50,692 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash -424598378, now seen corresponding path program 1 times [2019-09-10 07:08:50,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:50,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:50,835 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-10 07:08:50,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:50,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:50,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:50,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:50,836 INFO L87 Difference]: Start difference. First operand 69839 states and 96164 transitions. Second operand 3 states. [2019-09-10 07:08:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:51,277 INFO L93 Difference]: Finished difference Result 129166 states and 177390 transitions. [2019-09-10 07:08:51,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:51,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 07:08:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:51,470 INFO L225 Difference]: With dead ends: 129166 [2019-09-10 07:08:51,470 INFO L226 Difference]: Without dead ends: 129166 [2019-09-10 07:08:51,470 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-10 07:08:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129166 states. [2019-09-10 07:08:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129166 to 129164. [2019-09-10 07:08:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129164 states. [2019-09-10 07:08:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129164 states to 129164 states and 177389 transitions. [2019-09-10 07:08:53,288 INFO L78 Accepts]: Start accepts. Automaton has 129164 states and 177389 transitions. Word has length 110 [2019-09-10 07:08:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:53,288 INFO L475 AbstractCegarLoop]: Abstraction has 129164 states and 177389 transitions. [2019-09-10 07:08:53,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 129164 states and 177389 transitions. [2019-09-10 07:08:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:08:53,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:53,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:53,367 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash -966656611, now seen corresponding path program 1 times [2019-09-10 07:08:53,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:53,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:53,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:53,604 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-10 07:08:53,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:53,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:53,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:53,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:53,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:53,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:53,606 INFO L87 Difference]: Start difference. First operand 129164 states and 177389 transitions. Second operand 7 states. [2019-09-10 07:08:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:54,380 INFO L93 Difference]: Finished difference Result 170543 states and 232825 transitions. [2019-09-10 07:08:54,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:08:54,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2019-09-10 07:08:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:54,807 INFO L225 Difference]: With dead ends: 170543 [2019-09-10 07:08:54,808 INFO L226 Difference]: Without dead ends: 169415 [2019-09-10 07:08:54,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169415 states. [2019-09-10 07:08:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169415 to 147669. [2019-09-10 07:08:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147669 states. [2019-09-10 07:09:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147669 states to 147669 states and 202215 transitions. [2019-09-10 07:09:00,527 INFO L78 Accepts]: Start accepts. Automaton has 147669 states and 202215 transitions. Word has length 111 [2019-09-10 07:09:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:00,527 INFO L475 AbstractCegarLoop]: Abstraction has 147669 states and 202215 transitions. [2019-09-10 07:09:00,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 147669 states and 202215 transitions. [2019-09-10 07:09:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:09:00,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:00,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:00,605 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash -314118185, now seen corresponding path program 1 times [2019-09-10 07:09:00,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:00,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:00,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:00,771 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-10 07:09:00,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:00,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:09:00,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:00,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:09:00,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:09:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:09:00,773 INFO L87 Difference]: Start difference. First operand 147669 states and 202215 transitions. Second operand 6 states. [2019-09-10 07:09:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:01,640 INFO L93 Difference]: Finished difference Result 350637 states and 478129 transitions. [2019-09-10 07:09:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:09:01,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-09-10 07:09:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:02,084 INFO L225 Difference]: With dead ends: 350637 [2019-09-10 07:09:02,084 INFO L226 Difference]: Without dead ends: 350637 [2019-09-10 07:09:02,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:09:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350637 states. [2019-09-10 07:09:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350637 to 150885. [2019-09-10 07:09:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150885 states. [2019-09-10 07:09:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150885 states to 150885 states and 205431 transitions. [2019-09-10 07:09:05,169 INFO L78 Accepts]: Start accepts. Automaton has 150885 states and 205431 transitions. Word has length 112 [2019-09-10 07:09:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:05,170 INFO L475 AbstractCegarLoop]: Abstraction has 150885 states and 205431 transitions. [2019-09-10 07:09:05,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:09:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 150885 states and 205431 transitions. [2019-09-10 07:09:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:09:05,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:05,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:05,262 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:05,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:05,262 INFO L82 PathProgramCache]: Analyzing trace with hash -731283287, now seen corresponding path program 1 times [2019-09-10 07:09:05,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:05,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:05,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:05,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:05,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:05,424 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-10 07:09:05,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:05,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:05,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:05,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:05,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:05,426 INFO L87 Difference]: Start difference. First operand 150885 states and 205431 transitions. Second operand 3 states. [2019-09-10 07:09:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:06,123 INFO L93 Difference]: Finished difference Result 284575 states and 385416 transitions. [2019-09-10 07:09:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:06,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 07:09:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:06,530 INFO L225 Difference]: With dead ends: 284575 [2019-09-10 07:09:06,530 INFO L226 Difference]: Without dead ends: 284575 [2019-09-10 07:09:06,530 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-10 07:09:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284575 states. [2019-09-10 07:09:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284575 to 270685. [2019-09-10 07:09:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270685 states. [2019-09-10 07:09:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270685 states to 270685 states and 367287 transitions. [2019-09-10 07:09:15,736 INFO L78 Accepts]: Start accepts. Automaton has 270685 states and 367287 transitions. Word has length 113 [2019-09-10 07:09:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:15,736 INFO L475 AbstractCegarLoop]: Abstraction has 270685 states and 367287 transitions. [2019-09-10 07:09:15,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 270685 states and 367287 transitions. [2019-09-10 07:09:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:09:15,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:15,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:15,846 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:15,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2028171035, now seen corresponding path program 1 times [2019-09-10 07:09:15,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:15,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:15,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:16,014 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-10 07:09:16,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:16,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:16,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:16,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:16,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:16,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:16,016 INFO L87 Difference]: Start difference. First operand 270685 states and 367287 transitions. Second operand 3 states. [2019-09-10 07:09:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:16,971 INFO L93 Difference]: Finished difference Result 404847 states and 545744 transitions. [2019-09-10 07:09:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:16,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 07:09:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:17,607 INFO L225 Difference]: With dead ends: 404847 [2019-09-10 07:09:17,607 INFO L226 Difference]: Without dead ends: 404847 [2019-09-10 07:09:17,607 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-10 07:09:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404847 states. [2019-09-10 07:09:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404847 to 404845. [2019-09-10 07:09:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404845 states. [2019-09-10 07:09:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404845 states to 404845 states and 545743 transitions. [2019-09-10 07:09:32,473 INFO L78 Accepts]: Start accepts. Automaton has 404845 states and 545743 transitions. Word has length 114 [2019-09-10 07:09:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:32,473 INFO L475 AbstractCegarLoop]: Abstraction has 404845 states and 545743 transitions. [2019-09-10 07:09:32,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 404845 states and 545743 transitions. [2019-09-10 07:09:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:09:32,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:32,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:32,543 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1883673127, now seen corresponding path program 1 times [2019-09-10 07:09:32,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:32,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:32,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:32,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:32,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:32,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-10 07:09:32,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:32,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:32,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:32,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:32,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:32,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:32,761 INFO L87 Difference]: Start difference. First operand 404845 states and 545743 transitions. Second operand 7 states. [2019-09-10 07:09:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:39,763 INFO L93 Difference]: Finished difference Result 1524703 states and 2051830 transitions. [2019-09-10 07:09:39,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:09:39,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-09-10 07:09:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:42,339 INFO L225 Difference]: With dead ends: 1524703 [2019-09-10 07:09:42,339 INFO L226 Difference]: Without dead ends: 1524703 [2019-09-10 07:09:42,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:09:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524703 states. [2019-09-10 07:10:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524703 to 525645. [2019-09-10 07:10:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525645 states. [2019-09-10 07:10:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525645 states to 525645 states and 714319 transitions. [2019-09-10 07:10:17,826 INFO L78 Accepts]: Start accepts. Automaton has 525645 states and 714319 transitions. Word has length 115 [2019-09-10 07:10:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:17,826 INFO L475 AbstractCegarLoop]: Abstraction has 525645 states and 714319 transitions. [2019-09-10 07:10:17,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 525645 states and 714319 transitions. [2019-09-10 07:10:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:10:17,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:17,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:10:17,919 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1097688602, now seen corresponding path program 1 times [2019-09-10 07:10:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:17,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:17,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:18,176 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-10 07:10:18,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:18,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:18,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:18,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:18,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:18,178 INFO L87 Difference]: Start difference. First operand 525645 states and 714319 transitions. Second operand 7 states. [2019-09-10 07:10:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:40,665 INFO L93 Difference]: Finished difference Result 1901477 states and 2560660 transitions. [2019-09-10 07:10:40,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:40,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-09-10 07:10:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:44,117 INFO L225 Difference]: With dead ends: 1901477 [2019-09-10 07:10:44,117 INFO L226 Difference]: Without dead ends: 1901477 [2019-09-10 07:10:44,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901477 states. [2019-09-10 07:11:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901477 to 749673. [2019-09-10 07:11:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749673 states. [2019-09-10 07:11:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749673 states to 749673 states and 1028299 transitions. [2019-09-10 07:11:09,681 INFO L78 Accepts]: Start accepts. Automaton has 749673 states and 1028299 transitions. Word has length 115 [2019-09-10 07:11:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:09,681 INFO L475 AbstractCegarLoop]: Abstraction has 749673 states and 1028299 transitions. [2019-09-10 07:11:09,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 749673 states and 1028299 transitions. [2019-09-10 07:11:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:11:09,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:09,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:09,794 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash -448059618, now seen corresponding path program 1 times [2019-09-10 07:11:09,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:09,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:09,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:09,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:09,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:09,935 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-10 07:11:09,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:11:09,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:09,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:11:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:11:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:11:09,937 INFO L87 Difference]: Start difference. First operand 749673 states and 1028299 transitions. Second operand 5 states. [2019-09-10 07:11:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:24,971 INFO L93 Difference]: Finished difference Result 1735608 states and 2353359 transitions. [2019-09-10 07:11:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:11:24,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-10 07:11:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:28,110 INFO L225 Difference]: With dead ends: 1735608 [2019-09-10 07:11:28,110 INFO L226 Difference]: Without dead ends: 1735608 [2019-09-10 07:11:28,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:11:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735608 states. [2019-09-10 07:12:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735608 to 924219. [2019-09-10 07:12:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924219 states. [2019-09-10 07:12:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924219 states to 924219 states and 1253639 transitions. [2019-09-10 07:12:15,551 INFO L78 Accepts]: Start accepts. Automaton has 924219 states and 1253639 transitions. Word has length 115 [2019-09-10 07:12:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:15,551 INFO L475 AbstractCegarLoop]: Abstraction has 924219 states and 1253639 transitions. [2019-09-10 07:12:15,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:12:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 924219 states and 1253639 transitions. [2019-09-10 07:12:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:12:15,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:15,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:15,628 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:15,629 INFO L82 PathProgramCache]: Analyzing trace with hash -706806256, now seen corresponding path program 1 times [2019-09-10 07:12:15,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:15,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:15,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:15,813 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-10 07:12:15,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:15,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:12:15,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:15,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:12:15,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:12:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:15,815 INFO L87 Difference]: Start difference. First operand 924219 states and 1253639 transitions. Second operand 7 states. [2019-09-10 07:12:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:38,887 INFO L93 Difference]: Finished difference Result 2843590 states and 3821929 transitions. [2019-09-10 07:12:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:12:38,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-09-10 07:12:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:45,530 INFO L225 Difference]: With dead ends: 2843590 [2019-09-10 07:12:45,530 INFO L226 Difference]: Without dead ends: 2843590 [2019-09-10 07:12:45,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:13:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843590 states. [2019-09-10 07:13:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843590 to 1228013. [2019-09-10 07:13:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228013 states. [2019-09-10 07:13:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228013 states to 1228013 states and 1665379 transitions. [2019-09-10 07:13:44,700 INFO L78 Accepts]: Start accepts. Automaton has 1228013 states and 1665379 transitions. Word has length 116 [2019-09-10 07:13:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:44,700 INFO L475 AbstractCegarLoop]: Abstraction has 1228013 states and 1665379 transitions. [2019-09-10 07:13:44,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1228013 states and 1665379 transitions. [2019-09-10 07:13:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 07:13:45,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:45,188 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:13:45,188 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:45,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:45,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2015311786, now seen corresponding path program 1 times [2019-09-10 07:13:45,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:45,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:45,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:45,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:45,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:45,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:45,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:45,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:45,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:45,389 INFO L87 Difference]: Start difference. First operand 1228013 states and 1665379 transitions. Second operand 3 states.