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.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:57:29,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:57:29,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:57:30,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:57:30,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:57:30,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:57:30,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:57:30,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:57:30,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:57:30,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:57:30,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:57:30,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:57:30,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:57:30,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:57:30,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:57:30,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:57:30,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:57:30,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:57:30,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:57:30,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:57:30,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:57:30,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:57:30,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:57:30,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:57:30,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:57:30,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:57:30,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:57:30,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:57:30,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:57:30,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:57:30,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:57:30,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:57:30,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:57:30,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:57:30,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:57:30,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:57:30,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:57:30,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:57:30,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:57:30,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:57:30,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:57:30,060 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 06:57:30,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:57:30,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:57:30,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:57:30,077 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:57:30,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:57:30,078 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:57:30,078 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:57:30,079 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:57:30,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:57:30,079 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:57:30,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:57:30,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:57:30,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:57:30,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:57:30,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:57:30,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:57:30,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:57:30,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:57:30,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:57:30,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:57:30,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:57:30,082 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:57:30,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:57:30,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:57:30,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:57:30,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:57:30,083 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:57:30,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:57:30,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:57:30,084 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:57:30,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:57:30,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:57:30,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:57:30,130 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:57:30,130 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:57:30,131 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.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 06:57:30,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def78d9bb/f182d471b964494faff0f97dddd297b8/FLAG3fadff2df [2019-09-10 06:57:30,884 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:57:30,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 06:57:30,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def78d9bb/f182d471b964494faff0f97dddd297b8/FLAG3fadff2df [2019-09-10 06:57:30,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def78d9bb/f182d471b964494faff0f97dddd297b8 [2019-09-10 06:57:30,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:57:30,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:57:30,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:57:30,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:57:30,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:57:30,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:57:30" (1/1) ... [2019-09-10 06:57:30,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b3c9612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:30, skipping insertion in model container [2019-09-10 06:57:30,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:57:30" (1/1) ... [2019-09-10 06:57:30,996 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:57:31,183 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:57:32,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:57:32,638 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:57:33,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:57:33,301 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:57:33,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33 WrapperNode [2019-09-10 06:57:33,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:57:33,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:57:33,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:57:33,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:57:33,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (1/1) ... [2019-09-10 06:57:33,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (1/1) ... [2019-09-10 06:57:33,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (1/1) ... [2019-09-10 06:57:33,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (1/1) ... [2019-09-10 06:57:33,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (1/1) ... [2019-09-10 06:57:33,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (1/1) ... [2019-09-10 06:57:33,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (1/1) ... [2019-09-10 06:57:33,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:57:33,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:57:33,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:57:33,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:57:33,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (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 06:57:33,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:57:33,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:57:33,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:57:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:57:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:57:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:57:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:57:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:57:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:57:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:57:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:57:33,777 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:57:33,777 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:57:33,778 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:57:33,778 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:57:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:57:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:57:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:57:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:57:38,784 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:57:38,784 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:57:38,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:57:38 BoogieIcfgContainer [2019-09-10 06:57:38,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:57:38,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:57:38,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:57:38,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:57:38,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:57:30" (1/3) ... [2019-09-10 06:57:38,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323669d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:57:38, skipping insertion in model container [2019-09-10 06:57:38,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:33" (2/3) ... [2019-09-10 06:57:38,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323669d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:57:38, skipping insertion in model container [2019-09-10 06:57:38,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:57:38" (3/3) ... [2019-09-10 06:57:38,800 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 06:57:38,810 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:57:38,840 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 06:57:38,861 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 06:57:38,896 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:57:38,897 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:57:38,897 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:57:38,897 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:57:38,897 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:57:38,897 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:57:38,897 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:57:38,898 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:57:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states. [2019-09-10 06:57:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:57:39,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:39,013 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] [2019-09-10 06:57:39,015 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1426052776, now seen corresponding path program 1 times [2019-09-10 06:57:39,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:39,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:39,877 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 06:57:39,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:39,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:57:39,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:39,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:57:39,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:57:39,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:57:39,904 INFO L87 Difference]: Start difference. First operand 2051 states. Second operand 5 states. [2019-09-10 06:57:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:43,289 INFO L93 Difference]: Finished difference Result 2698 states and 4696 transitions. [2019-09-10 06:57:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:57:43,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-10 06:57:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:43,363 INFO L225 Difference]: With dead ends: 2698 [2019-09-10 06:57:43,363 INFO L226 Difference]: Without dead ends: 2686 [2019-09-10 06:57:43,368 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 06:57:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-09-10 06:57:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2680. [2019-09-10 06:57:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2019-09-10 06:57:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3477 transitions. [2019-09-10 06:57:43,609 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3477 transitions. Word has length 69 [2019-09-10 06:57:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:43,611 INFO L475 AbstractCegarLoop]: Abstraction has 2680 states and 3477 transitions. [2019-09-10 06:57:43,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:57:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3477 transitions. [2019-09-10 06:57:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:57:43,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:43,624 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] [2019-09-10 06:57:43,625 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:43,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:43,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2077560721, now seen corresponding path program 1 times [2019-09-10 06:57:43,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:43,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:43,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:43,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:43,990 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 06:57:43,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:43,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:43,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:43,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:43,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:43,998 INFO L87 Difference]: Start difference. First operand 2680 states and 3477 transitions. Second operand 6 states. [2019-09-10 06:57:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:46,081 INFO L93 Difference]: Finished difference Result 3335 states and 4373 transitions. [2019-09-10 06:57:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:57:46,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:57:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:46,098 INFO L225 Difference]: With dead ends: 3335 [2019-09-10 06:57:46,098 INFO L226 Difference]: Without dead ends: 3335 [2019-09-10 06:57:46,099 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 06:57:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2019-09-10 06:57:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3316. [2019-09-10 06:57:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2019-09-10 06:57:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 4359 transitions. [2019-09-10 06:57:46,177 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 4359 transitions. Word has length 70 [2019-09-10 06:57:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:46,178 INFO L475 AbstractCegarLoop]: Abstraction has 3316 states and 4359 transitions. [2019-09-10 06:57:46,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 4359 transitions. [2019-09-10 06:57:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:57:46,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:46,184 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] [2019-09-10 06:57:46,185 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1727713842, now seen corresponding path program 1 times [2019-09-10 06:57:46,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:46,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:46,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:46,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:46,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:46,381 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 06:57:46,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:46,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:46,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:46,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:46,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:46,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:46,384 INFO L87 Difference]: Start difference. First operand 3316 states and 4359 transitions. Second operand 6 states. [2019-09-10 06:57:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:48,390 INFO L93 Difference]: Finished difference Result 5659 states and 7350 transitions. [2019-09-10 06:57:48,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:57:48,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:57:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:48,419 INFO L225 Difference]: With dead ends: 5659 [2019-09-10 06:57:48,419 INFO L226 Difference]: Without dead ends: 5659 [2019-09-10 06:57:48,419 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 06:57:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2019-09-10 06:57:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 5632. [2019-09-10 06:57:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5632 states. [2019-09-10 06:57:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7330 transitions. [2019-09-10 06:57:48,542 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7330 transitions. Word has length 70 [2019-09-10 06:57:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:48,542 INFO L475 AbstractCegarLoop]: Abstraction has 5632 states and 7330 transitions. [2019-09-10 06:57:48,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7330 transitions. [2019-09-10 06:57:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:57:48,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:48,550 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] [2019-09-10 06:57:48,551 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1423274902, now seen corresponding path program 1 times [2019-09-10 06:57:48,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:48,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:48,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:48,964 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 06:57:48,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:48,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:57:48,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:48,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:57:48,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:57:48,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:57:48,966 INFO L87 Difference]: Start difference. First operand 5632 states and 7330 transitions. Second operand 10 states. [2019-09-10 06:57:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:56,503 INFO L93 Difference]: Finished difference Result 16984 states and 24464 transitions. [2019-09-10 06:57:56,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:57:56,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-09-10 06:57:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:56,579 INFO L225 Difference]: With dead ends: 16984 [2019-09-10 06:57:56,580 INFO L226 Difference]: Without dead ends: 16984 [2019-09-10 06:57:56,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:57:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16984 states. [2019-09-10 06:57:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16984 to 5639. [2019-09-10 06:57:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5639 states. [2019-09-10 06:57:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 7337 transitions. [2019-09-10 06:57:56,796 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 7337 transitions. Word has length 71 [2019-09-10 06:57:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:56,797 INFO L475 AbstractCegarLoop]: Abstraction has 5639 states and 7337 transitions. [2019-09-10 06:57:56,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:57:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7337 transitions. [2019-09-10 06:57:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:57:56,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:56,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] [2019-09-10 06:57:56,804 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:56,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash -717705231, now seen corresponding path program 1 times [2019-09-10 06:57:56,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:56,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:56,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:56,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:57,003 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 06:57:57,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:57,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:57:57,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:57,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:57:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:57:57,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:57:57,006 INFO L87 Difference]: Start difference. First operand 5639 states and 7337 transitions. Second operand 9 states. [2019-09-10 06:58:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:01,187 INFO L93 Difference]: Finished difference Result 8406 states and 11526 transitions. [2019-09-10 06:58:01,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:58:01,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 06:58:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:01,206 INFO L225 Difference]: With dead ends: 8406 [2019-09-10 06:58:01,206 INFO L226 Difference]: Without dead ends: 8406 [2019-09-10 06:58:01,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:58:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8406 states. [2019-09-10 06:58:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8406 to 5639. [2019-09-10 06:58:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5639 states. [2019-09-10 06:58:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 7336 transitions. [2019-09-10 06:58:01,319 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 7336 transitions. Word has length 72 [2019-09-10 06:58:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:01,319 INFO L475 AbstractCegarLoop]: Abstraction has 5639 states and 7336 transitions. [2019-09-10 06:58:01,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:58:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7336 transitions. [2019-09-10 06:58:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:58:01,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:01,328 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] [2019-09-10 06:58:01,328 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1312277498, now seen corresponding path program 1 times [2019-09-10 06:58:01,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:01,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:01,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:01,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:01,470 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 06:58:01,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:01,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:01,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:01,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:01,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:01,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:01,473 INFO L87 Difference]: Start difference. First operand 5639 states and 7336 transitions. Second operand 6 states. [2019-09-10 06:58:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:03,163 INFO L93 Difference]: Finished difference Result 10371 states and 13723 transitions. [2019-09-10 06:58:03,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:03,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-10 06:58:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:03,188 INFO L225 Difference]: With dead ends: 10371 [2019-09-10 06:58:03,188 INFO L226 Difference]: Without dead ends: 10371 [2019-09-10 06:58:03,188 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 06:58:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10371 states. [2019-09-10 06:58:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10371 to 10359. [2019-09-10 06:58:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2019-09-10 06:58:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 13715 transitions. [2019-09-10 06:58:03,354 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 13715 transitions. Word has length 72 [2019-09-10 06:58:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:03,356 INFO L475 AbstractCegarLoop]: Abstraction has 10359 states and 13715 transitions. [2019-09-10 06:58:03,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 13715 transitions. [2019-09-10 06:58:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:58:03,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:03,379 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] [2019-09-10 06:58:03,381 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:03,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash -426903766, now seen corresponding path program 1 times [2019-09-10 06:58:03,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:03,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:03,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:03,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:03,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:03,796 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-09-10 06:58:04,089 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 06:58:04,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:04,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:58:04,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:04,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:58:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:58:04,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:58:04,091 INFO L87 Difference]: Start difference. First operand 10359 states and 13715 transitions. Second operand 12 states. [2019-09-10 06:58:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:07,950 INFO L93 Difference]: Finished difference Result 52473 states and 76975 transitions. [2019-09-10 06:58:07,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:58:07,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-10 06:58:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:08,057 INFO L225 Difference]: With dead ends: 52473 [2019-09-10 06:58:08,058 INFO L226 Difference]: Without dead ends: 52473 [2019-09-10 06:58:08,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:58:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52473 states. [2019-09-10 06:58:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52473 to 10227. [2019-09-10 06:58:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10227 states. [2019-09-10 06:58:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10227 states to 10227 states and 13529 transitions. [2019-09-10 06:58:08,563 INFO L78 Accepts]: Start accepts. Automaton has 10227 states and 13529 transitions. Word has length 72 [2019-09-10 06:58:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:08,563 INFO L475 AbstractCegarLoop]: Abstraction has 10227 states and 13529 transitions. [2019-09-10 06:58:08,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:58:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 10227 states and 13529 transitions. [2019-09-10 06:58:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:58:08,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:08,577 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] [2019-09-10 06:58:08,577 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 808228230, now seen corresponding path program 1 times [2019-09-10 06:58:08,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:08,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:08,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:08,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:09,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:09,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:58:09,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:09,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:58:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:58:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:58:09,614 INFO L87 Difference]: Start difference. First operand 10227 states and 13529 transitions. Second operand 10 states. [2019-09-10 06:58:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:15,225 INFO L93 Difference]: Finished difference Result 32494 states and 46213 transitions. [2019-09-10 06:58:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:58:15,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-10 06:58:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:15,283 INFO L225 Difference]: With dead ends: 32494 [2019-09-10 06:58:15,283 INFO L226 Difference]: Without dead ends: 32494 [2019-09-10 06:58:15,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:58:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32494 states. [2019-09-10 06:58:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32494 to 10199. [2019-09-10 06:58:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10199 states. [2019-09-10 06:58:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 13496 transitions. [2019-09-10 06:58:15,625 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 13496 transitions. Word has length 73 [2019-09-10 06:58:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:15,625 INFO L475 AbstractCegarLoop]: Abstraction has 10199 states and 13496 transitions. [2019-09-10 06:58:15,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:58:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 13496 transitions. [2019-09-10 06:58:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:58:15,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:15,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] [2019-09-10 06:58:15,635 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:15,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1947735451, now seen corresponding path program 1 times [2019-09-10 06:58:15,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:15,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:15,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:16,143 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 06:58:16,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:16,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:58:16,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:16,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:58:16,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:58:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:58:16,145 INFO L87 Difference]: Start difference. First operand 10199 states and 13496 transitions. Second operand 12 states. [2019-09-10 06:58:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:20,084 INFO L93 Difference]: Finished difference Result 52349 states and 76825 transitions. [2019-09-10 06:58:20,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:58:20,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 06:58:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:20,161 INFO L225 Difference]: With dead ends: 52349 [2019-09-10 06:58:20,161 INFO L226 Difference]: Without dead ends: 52349 [2019-09-10 06:58:20,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:58:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52349 states. [2019-09-10 06:58:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52349 to 10190. [2019-09-10 06:58:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10190 states. [2019-09-10 06:58:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10190 states to 10190 states and 13487 transitions. [2019-09-10 06:58:20,605 INFO L78 Accepts]: Start accepts. Automaton has 10190 states and 13487 transitions. Word has length 73 [2019-09-10 06:58:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:20,605 INFO L475 AbstractCegarLoop]: Abstraction has 10190 states and 13487 transitions. [2019-09-10 06:58:20,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:58:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 10190 states and 13487 transitions. [2019-09-10 06:58:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:58:20,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:20,614 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] [2019-09-10 06:58:20,615 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash -203314022, now seen corresponding path program 1 times [2019-09-10 06:58:20,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:20,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:20,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:20,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:20,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:21,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:21,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:58:21,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:21,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:58:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:58:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:58:21,225 INFO L87 Difference]: Start difference. First operand 10190 states and 13487 transitions. Second operand 12 states. [2019-09-10 06:58:22,055 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:58:22,397 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 06:58:22,686 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:58:23,007 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:58:23,256 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:58:23,871 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:58:24,326 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:58:25,380 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 06:58:25,743 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:58:25,955 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:58:26,250 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:58:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:26,776 INFO L93 Difference]: Finished difference Result 50249 states and 73721 transitions. [2019-09-10 06:58:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:58:26,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 06:58:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:26,833 INFO L225 Difference]: With dead ends: 50249 [2019-09-10 06:58:26,833 INFO L226 Difference]: Without dead ends: 50249 [2019-09-10 06:58:26,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:58:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50249 states. [2019-09-10 06:58:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50249 to 10200. [2019-09-10 06:58:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10200 states. [2019-09-10 06:58:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10200 states to 10200 states and 13500 transitions. [2019-09-10 06:58:27,164 INFO L78 Accepts]: Start accepts. Automaton has 10200 states and 13500 transitions. Word has length 74 [2019-09-10 06:58:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:27,165 INFO L475 AbstractCegarLoop]: Abstraction has 10200 states and 13500 transitions. [2019-09-10 06:58:27,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:58:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 10200 states and 13500 transitions. [2019-09-10 06:58:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:58:27,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:27,179 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] [2019-09-10 06:58:27,179 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:27,179 INFO L82 PathProgramCache]: Analyzing trace with hash 921468835, now seen corresponding path program 1 times [2019-09-10 06:58:27,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:27,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:27,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:27,271 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 06:58:27,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:27,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:27,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:27,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:27,273 INFO L87 Difference]: Start difference. First operand 10200 states and 13500 transitions. Second operand 3 states. [2019-09-10 06:58:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:27,529 INFO L93 Difference]: Finished difference Result 12555 states and 17086 transitions. [2019-09-10 06:58:27,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:27,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:58:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:27,541 INFO L225 Difference]: With dead ends: 12555 [2019-09-10 06:58:27,541 INFO L226 Difference]: Without dead ends: 12555 [2019-09-10 06:58:27,542 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 06:58:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12555 states. [2019-09-10 06:58:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12555 to 12544. [2019-09-10 06:58:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12544 states. [2019-09-10 06:58:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12544 states to 12544 states and 17078 transitions. [2019-09-10 06:58:27,729 INFO L78 Accepts]: Start accepts. Automaton has 12544 states and 17078 transitions. Word has length 75 [2019-09-10 06:58:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:27,730 INFO L475 AbstractCegarLoop]: Abstraction has 12544 states and 17078 transitions. [2019-09-10 06:58:27,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 12544 states and 17078 transitions. [2019-09-10 06:58:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:58:27,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:27,742 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] [2019-09-10 06:58:27,742 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -586638805, now seen corresponding path program 1 times [2019-09-10 06:58:27,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:27,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:27,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:27,825 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 06:58:27,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:27,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:27,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:27,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:27,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:27,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:27,826 INFO L87 Difference]: Start difference. First operand 12544 states and 17078 transitions. Second operand 3 states. [2019-09-10 06:58:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:27,965 INFO L93 Difference]: Finished difference Result 14944 states and 21171 transitions. [2019-09-10 06:58:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:27,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:58:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:27,981 INFO L225 Difference]: With dead ends: 14944 [2019-09-10 06:58:27,981 INFO L226 Difference]: Without dead ends: 14944 [2019-09-10 06:58:27,982 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 06:58:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14944 states. [2019-09-10 06:58:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14944 to 14931. [2019-09-10 06:58:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2019-09-10 06:58:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 21161 transitions. [2019-09-10 06:58:28,121 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 21161 transitions. Word has length 75 [2019-09-10 06:58:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:28,121 INFO L475 AbstractCegarLoop]: Abstraction has 14931 states and 21161 transitions. [2019-09-10 06:58:28,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 21161 transitions. [2019-09-10 06:58:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:58:28,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:28,128 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] [2019-09-10 06:58:28,128 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash -892848695, now seen corresponding path program 1 times [2019-09-10 06:58:28,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:28,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:28,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:28,304 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 06:58:28,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:28,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:58:28,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:28,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:58:28,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:58:28,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:58:28,306 INFO L87 Difference]: Start difference. First operand 14931 states and 21161 transitions. Second operand 9 states. [2019-09-10 06:58:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:31,215 INFO L93 Difference]: Finished difference Result 39938 states and 58292 transitions. [2019-09-10 06:58:31,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:58:31,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:58:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:31,251 INFO L225 Difference]: With dead ends: 39938 [2019-09-10 06:58:31,251 INFO L226 Difference]: Without dead ends: 39938 [2019-09-10 06:58:31,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:58:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states. [2019-09-10 06:58:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 14931. [2019-09-10 06:58:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2019-09-10 06:58:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 21160 transitions. [2019-09-10 06:58:31,588 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 21160 transitions. Word has length 75 [2019-09-10 06:58:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:31,588 INFO L475 AbstractCegarLoop]: Abstraction has 14931 states and 21160 transitions. [2019-09-10 06:58:31,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:58:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 21160 transitions. [2019-09-10 06:58:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:58:31,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:31,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:31,594 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 352856601, now seen corresponding path program 1 times [2019-09-10 06:58:31,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:31,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:31,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:31,839 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 06:58:31,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:31,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:58:31,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:31,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:58:31,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:58:31,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:58:31,841 INFO L87 Difference]: Start difference. First operand 14931 states and 21160 transitions. Second operand 10 states. [2019-09-10 06:58:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:35,891 INFO L93 Difference]: Finished difference Result 60271 states and 89216 transitions. [2019-09-10 06:58:35,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:58:35,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-09-10 06:58:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:35,952 INFO L225 Difference]: With dead ends: 60271 [2019-09-10 06:58:35,953 INFO L226 Difference]: Without dead ends: 60271 [2019-09-10 06:58:35,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:58:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60271 states. [2019-09-10 06:58:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60271 to 14931. [2019-09-10 06:58:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2019-09-10 06:58:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 21159 transitions. [2019-09-10 06:58:36,517 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 21159 transitions. Word has length 76 [2019-09-10 06:58:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:36,517 INFO L475 AbstractCegarLoop]: Abstraction has 14931 states and 21159 transitions. [2019-09-10 06:58:36,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:58:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 21159 transitions. [2019-09-10 06:58:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:58:36,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:36,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:36,522 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash -260698378, now seen corresponding path program 1 times [2019-09-10 06:58:36,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:36,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:36,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:36,966 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 06:58:36,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:36,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:58:36,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:36,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:58:36,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:58:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:58:36,969 INFO L87 Difference]: Start difference. First operand 14931 states and 21159 transitions. Second operand 12 states. [2019-09-10 06:58:37,536 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 06:58:37,689 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:58:37,839 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:58:38,012 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:58:38,205 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 06:58:39,197 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:58:39,943 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 06:58:40,313 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 06:58:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:40,609 INFO L93 Difference]: Finished difference Result 81546 states and 121043 transitions. [2019-09-10 06:58:40,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:58:40,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2019-09-10 06:58:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:40,683 INFO L225 Difference]: With dead ends: 81546 [2019-09-10 06:58:40,684 INFO L226 Difference]: Without dead ends: 81546 [2019-09-10 06:58:40,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:58:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81546 states. [2019-09-10 06:58:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81546 to 14846. [2019-09-10 06:58:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14846 states. [2019-09-10 06:58:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14846 states to 14846 states and 21067 transitions. [2019-09-10 06:58:41,961 INFO L78 Accepts]: Start accepts. Automaton has 14846 states and 21067 transitions. Word has length 76 [2019-09-10 06:58:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:41,961 INFO L475 AbstractCegarLoop]: Abstraction has 14846 states and 21067 transitions. [2019-09-10 06:58:41,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:58:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 14846 states and 21067 transitions. [2019-09-10 06:58:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:58:41,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:41,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:41,967 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:41,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:41,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1896278784, now seen corresponding path program 1 times [2019-09-10 06:58:41,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:41,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:41,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:41,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:41,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:42,063 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 06:58:42,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:42,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:42,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:42,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:42,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:42,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:42,065 INFO L87 Difference]: Start difference. First operand 14846 states and 21067 transitions. Second operand 3 states. [2019-09-10 06:58:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:42,230 INFO L93 Difference]: Finished difference Result 23779 states and 34273 transitions. [2019-09-10 06:58:42,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:42,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:58:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:42,256 INFO L225 Difference]: With dead ends: 23779 [2019-09-10 06:58:42,256 INFO L226 Difference]: Without dead ends: 23779 [2019-09-10 06:58:42,257 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 06:58:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23779 states. [2019-09-10 06:58:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23779 to 23777. [2019-09-10 06:58:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23777 states. [2019-09-10 06:58:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23777 states to 23777 states and 34272 transitions. [2019-09-10 06:58:42,471 INFO L78 Accepts]: Start accepts. Automaton has 23777 states and 34272 transitions. Word has length 77 [2019-09-10 06:58:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:42,471 INFO L475 AbstractCegarLoop]: Abstraction has 23777 states and 34272 transitions. [2019-09-10 06:58:42,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 23777 states and 34272 transitions. [2019-09-10 06:58:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:58:42,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:42,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:42,475 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash -722727837, now seen corresponding path program 1 times [2019-09-10 06:58:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:42,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:42,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:42,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:42,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:42,686 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 06:58:42,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:42,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:58:42,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:42,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:58:42,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:58:42,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:58:42,688 INFO L87 Difference]: Start difference. First operand 23777 states and 34272 transitions. Second operand 10 states. [2019-09-10 06:58:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:47,153 INFO L93 Difference]: Finished difference Result 58040 states and 83894 transitions. [2019-09-10 06:58:47,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:58:47,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-09-10 06:58:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:47,211 INFO L225 Difference]: With dead ends: 58040 [2019-09-10 06:58:47,211 INFO L226 Difference]: Without dead ends: 58040 [2019-09-10 06:58:47,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:58:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58040 states. [2019-09-10 06:58:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58040 to 23777. [2019-09-10 06:58:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23777 states. [2019-09-10 06:58:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23777 states to 23777 states and 34271 transitions. [2019-09-10 06:58:47,577 INFO L78 Accepts]: Start accepts. Automaton has 23777 states and 34271 transitions. Word has length 77 [2019-09-10 06:58:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:47,577 INFO L475 AbstractCegarLoop]: Abstraction has 23777 states and 34271 transitions. [2019-09-10 06:58:47,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:58:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 23777 states and 34271 transitions. [2019-09-10 06:58:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:58:47,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:47,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:47,582 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:47,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:47,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1364267603, now seen corresponding path program 1 times [2019-09-10 06:58:47,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:47,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:47,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:47,740 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 06:58:47,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:47,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:58:47,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:47,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:58:47,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:58:47,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:58:47,741 INFO L87 Difference]: Start difference. First operand 23777 states and 34271 transitions. Second operand 9 states. [2019-09-10 06:58:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:51,837 INFO L93 Difference]: Finished difference Result 68957 states and 100410 transitions. [2019-09-10 06:58:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:58:51,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-10 06:58:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:51,917 INFO L225 Difference]: With dead ends: 68957 [2019-09-10 06:58:51,917 INFO L226 Difference]: Without dead ends: 68957 [2019-09-10 06:58:51,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:58:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68957 states. [2019-09-10 06:58:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68957 to 23777. [2019-09-10 06:58:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23777 states. [2019-09-10 06:58:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23777 states to 23777 states and 34270 transitions. [2019-09-10 06:58:52,309 INFO L78 Accepts]: Start accepts. Automaton has 23777 states and 34270 transitions. Word has length 77 [2019-09-10 06:58:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:52,309 INFO L475 AbstractCegarLoop]: Abstraction has 23777 states and 34270 transitions. [2019-09-10 06:58:52,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:58:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 23777 states and 34270 transitions. [2019-09-10 06:58:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:58:52,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:52,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:52,314 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 330353004, now seen corresponding path program 1 times [2019-09-10 06:58:52,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:52,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:52,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:52,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:52,399 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 06:58:52,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:52,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:52,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:52,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:52,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:52,401 INFO L87 Difference]: Start difference. First operand 23777 states and 34270 transitions. Second operand 3 states. [2019-09-10 06:58:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:52,533 INFO L93 Difference]: Finished difference Result 41671 states and 60296 transitions. [2019-09-10 06:58:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:52,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:58:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:52,575 INFO L225 Difference]: With dead ends: 41671 [2019-09-10 06:58:52,575 INFO L226 Difference]: Without dead ends: 41671 [2019-09-10 06:58:52,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 06:58:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41671 states. [2019-09-10 06:58:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41671 to 29465. [2019-09-10 06:58:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29465 states. [2019-09-10 06:58:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29465 states to 29465 states and 42436 transitions. [2019-09-10 06:58:52,901 INFO L78 Accepts]: Start accepts. Automaton has 29465 states and 42436 transitions. Word has length 78 [2019-09-10 06:58:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:52,901 INFO L475 AbstractCegarLoop]: Abstraction has 29465 states and 42436 transitions. [2019-09-10 06:58:52,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29465 states and 42436 transitions. [2019-09-10 06:58:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:58:52,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:52,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:52,906 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1275820425, now seen corresponding path program 1 times [2019-09-10 06:58:52,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:52,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:52,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:52,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:52,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:53,003 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 06:58:53,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:53,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:53,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:53,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:53,005 INFO L87 Difference]: Start difference. First operand 29465 states and 42436 transitions. Second operand 3 states. [2019-09-10 06:58:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:53,244 INFO L93 Difference]: Finished difference Result 53487 states and 76337 transitions. [2019-09-10 06:58:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:53,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:58:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:53,316 INFO L225 Difference]: With dead ends: 53487 [2019-09-10 06:58:53,316 INFO L226 Difference]: Without dead ends: 53487 [2019-09-10 06:58:53,317 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 06:58:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53487 states. [2019-09-10 06:58:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53487 to 44873. [2019-09-10 06:58:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44873 states. [2019-09-10 06:58:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44873 states to 44873 states and 63899 transitions. [2019-09-10 06:58:54,128 INFO L78 Accepts]: Start accepts. Automaton has 44873 states and 63899 transitions. Word has length 78 [2019-09-10 06:58:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:54,128 INFO L475 AbstractCegarLoop]: Abstraction has 44873 states and 63899 transitions. [2019-09-10 06:58:54,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 44873 states and 63899 transitions. [2019-09-10 06:58:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:58:54,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:54,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:54,134 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:54,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:54,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1108611303, now seen corresponding path program 1 times [2019-09-10 06:58:54,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:54,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:54,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:54,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:54,214 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 06:58:54,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:54,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:54,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:54,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:54,216 INFO L87 Difference]: Start difference. First operand 44873 states and 63899 transitions. Second operand 3 states. [2019-09-10 06:58:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:54,464 INFO L93 Difference]: Finished difference Result 76485 states and 109777 transitions. [2019-09-10 06:58:54,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:54,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:58:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:54,557 INFO L225 Difference]: With dead ends: 76485 [2019-09-10 06:58:54,557 INFO L226 Difference]: Without dead ends: 76485 [2019-09-10 06:58:54,557 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 06:58:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76485 states. [2019-09-10 06:58:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76485 to 59119. [2019-09-10 06:58:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59119 states. [2019-09-10 06:58:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59119 states to 59119 states and 84762 transitions. [2019-09-10 06:58:55,244 INFO L78 Accepts]: Start accepts. Automaton has 59119 states and 84762 transitions. Word has length 79 [2019-09-10 06:58:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:55,244 INFO L475 AbstractCegarLoop]: Abstraction has 59119 states and 84762 transitions. [2019-09-10 06:58:55,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 59119 states and 84762 transitions. [2019-09-10 06:58:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:58:55,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:55,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:55,248 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash -857135845, now seen corresponding path program 1 times [2019-09-10 06:58:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:55,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:55,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:55,468 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 06:58:55,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:55,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:58:55,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:55,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:58:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:58:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:58:55,470 INFO L87 Difference]: Start difference. First operand 59119 states and 84762 transitions. Second operand 10 states. [2019-09-10 06:59:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:00,095 INFO L93 Difference]: Finished difference Result 124222 states and 176888 transitions. [2019-09-10 06:59:00,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:59:00,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-09-10 06:59:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:00,240 INFO L225 Difference]: With dead ends: 124222 [2019-09-10 06:59:00,241 INFO L226 Difference]: Without dead ends: 124222 [2019-09-10 06:59:00,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:59:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124222 states. [2019-09-10 06:59:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124222 to 59119. [2019-09-10 06:59:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59119 states. [2019-09-10 06:59:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59119 states to 59119 states and 84761 transitions. [2019-09-10 06:59:01,235 INFO L78 Accepts]: Start accepts. Automaton has 59119 states and 84761 transitions. Word has length 79 [2019-09-10 06:59:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:01,235 INFO L475 AbstractCegarLoop]: Abstraction has 59119 states and 84761 transitions. [2019-09-10 06:59:01,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 59119 states and 84761 transitions. [2019-09-10 06:59:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:59:01,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:01,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:01,238 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:01,238 INFO L82 PathProgramCache]: Analyzing trace with hash 882523075, now seen corresponding path program 1 times [2019-09-10 06:59:01,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:01,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:01,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:01,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:01,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:01,432 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 06:59:01,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:01,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:01,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:01,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:01,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:01,434 INFO L87 Difference]: Start difference. First operand 59119 states and 84761 transitions. Second operand 9 states. [2019-09-10 06:59:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:04,334 INFO L93 Difference]: Finished difference Result 104495 states and 149642 transitions. [2019-09-10 06:59:04,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:59:04,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 06:59:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:04,451 INFO L225 Difference]: With dead ends: 104495 [2019-09-10 06:59:04,451 INFO L226 Difference]: Without dead ends: 104495 [2019-09-10 06:59:04,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:59:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104495 states. [2019-09-10 06:59:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104495 to 59114. [2019-09-10 06:59:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-10 06:59:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84752 transitions. [2019-09-10 06:59:05,275 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84752 transitions. Word has length 79 [2019-09-10 06:59:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:05,275 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84752 transitions. [2019-09-10 06:59:05,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84752 transitions. [2019-09-10 06:59:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:59:05,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:05,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:05,278 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:05,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1930536495, now seen corresponding path program 1 times [2019-09-10 06:59:05,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:05,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:05,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:05,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:05,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:05,443 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 06:59:05,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:05,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:05,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:05,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:05,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:05,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:05,445 INFO L87 Difference]: Start difference. First operand 59114 states and 84752 transitions. Second operand 9 states. [2019-09-10 06:59:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:08,361 INFO L93 Difference]: Finished difference Result 104503 states and 149650 transitions. [2019-09-10 06:59:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:59:08,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 06:59:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:08,500 INFO L225 Difference]: With dead ends: 104503 [2019-09-10 06:59:08,500 INFO L226 Difference]: Without dead ends: 104503 [2019-09-10 06:59:08,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:59:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104503 states. [2019-09-10 06:59:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104503 to 59114. [2019-09-10 06:59:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-10 06:59:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84751 transitions. [2019-09-10 06:59:09,300 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84751 transitions. Word has length 80 [2019-09-10 06:59:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:09,301 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84751 transitions. [2019-09-10 06:59:09,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84751 transitions. [2019-09-10 06:59:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:59:09,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:09,304 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] [2019-09-10 06:59:09,304 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1355470910, now seen corresponding path program 1 times [2019-09-10 06:59:09,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:09,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:09,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:09,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:09,465 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 06:59:09,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:09,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:09,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:09,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:09,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:09,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:09,466 INFO L87 Difference]: Start difference. First operand 59114 states and 84751 transitions. Second operand 9 states. [2019-09-10 06:59:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:12,109 INFO L93 Difference]: Finished difference Result 104495 states and 149640 transitions. [2019-09-10 06:59:12,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:59:12,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 06:59:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:12,234 INFO L225 Difference]: With dead ends: 104495 [2019-09-10 06:59:12,234 INFO L226 Difference]: Without dead ends: 104495 [2019-09-10 06:59:12,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:59:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104495 states. [2019-09-10 06:59:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104495 to 59114. [2019-09-10 06:59:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-10 06:59:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84750 transitions. [2019-09-10 06:59:13,453 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84750 transitions. Word has length 80 [2019-09-10 06:59:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:13,453 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84750 transitions. [2019-09-10 06:59:13,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84750 transitions. [2019-09-10 06:59:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:59:13,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:13,456 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] [2019-09-10 06:59:13,456 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:13,456 INFO L82 PathProgramCache]: Analyzing trace with hash -520682382, now seen corresponding path program 1 times [2019-09-10 06:59:13,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:13,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:13,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:13,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:13,599 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 06:59:13,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:13,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:13,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:13,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:13,601 INFO L87 Difference]: Start difference. First operand 59114 states and 84750 transitions. Second operand 9 states. [2019-09-10 06:59:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:16,489 INFO L93 Difference]: Finished difference Result 104503 states and 149647 transitions. [2019-09-10 06:59:16,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:59:16,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 06:59:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:16,614 INFO L225 Difference]: With dead ends: 104503 [2019-09-10 06:59:16,615 INFO L226 Difference]: Without dead ends: 104503 [2019-09-10 06:59:16,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:59:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104503 states. [2019-09-10 06:59:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104503 to 59114. [2019-09-10 06:59:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-10 06:59:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84748 transitions. [2019-09-10 06:59:17,408 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84748 transitions. Word has length 80 [2019-09-10 06:59:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:17,408 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84748 transitions. [2019-09-10 06:59:17,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84748 transitions. [2019-09-10 06:59:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:59:17,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:17,411 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] [2019-09-10 06:59:17,411 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1815888049, now seen corresponding path program 1 times [2019-09-10 06:59:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:17,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:17,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:17,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:17,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:19,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:19,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:19,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:19,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:19,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:19,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:19,099 INFO L87 Difference]: Start difference. First operand 59114 states and 84748 transitions. Second operand 9 states. [2019-09-10 06:59:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:21,751 INFO L93 Difference]: Finished difference Result 104495 states and 149636 transitions. [2019-09-10 06:59:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:59:21,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 06:59:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:21,877 INFO L225 Difference]: With dead ends: 104495 [2019-09-10 06:59:21,877 INFO L226 Difference]: Without dead ends: 104495 [2019-09-10 06:59:21,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:59:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104495 states. [2019-09-10 06:59:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104495 to 59114. [2019-09-10 06:59:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-10 06:59:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84746 transitions. [2019-09-10 06:59:22,675 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84746 transitions. Word has length 80 [2019-09-10 06:59:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:22,675 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84746 transitions. [2019-09-10 06:59:22,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84746 transitions. [2019-09-10 06:59:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:59:22,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:22,679 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] [2019-09-10 06:59:22,679 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash 731986161, now seen corresponding path program 1 times [2019-09-10 06:59:22,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:22,837 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 06:59:22,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:22,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:22,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:22,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:22,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:22,839 INFO L87 Difference]: Start difference. First operand 59114 states and 84746 transitions. Second operand 9 states. [2019-09-10 06:59:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:25,514 INFO L93 Difference]: Finished difference Result 104495 states and 149634 transitions. [2019-09-10 06:59:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:59:25,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 06:59:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:25,648 INFO L225 Difference]: With dead ends: 104495 [2019-09-10 06:59:25,648 INFO L226 Difference]: Without dead ends: 104495 [2019-09-10 06:59:25,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:59:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104495 states. [2019-09-10 06:59:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104495 to 59114. [2019-09-10 06:59:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-10 06:59:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84744 transitions. [2019-09-10 06:59:26,802 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84744 transitions. Word has length 80 [2019-09-10 06:59:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:26,802 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84744 transitions. [2019-09-10 06:59:26,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84744 transitions. [2019-09-10 06:59:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:59:26,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:26,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:26,805 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:26,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:26,806 INFO L82 PathProgramCache]: Analyzing trace with hash -184854122, now seen corresponding path program 1 times [2019-09-10 06:59:26,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:26,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:26,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:26,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:26,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:26,880 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 06:59:26,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:26,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:26,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:26,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:26,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:26,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:26,882 INFO L87 Difference]: Start difference. First operand 59114 states and 84744 transitions. Second operand 3 states. [2019-09-10 06:59:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:27,184 INFO L93 Difference]: Finished difference Result 108164 states and 153256 transitions. [2019-09-10 06:59:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:27,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 06:59:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:27,306 INFO L225 Difference]: With dead ends: 108164 [2019-09-10 06:59:27,306 INFO L226 Difference]: Without dead ends: 108164 [2019-09-10 06:59:27,307 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 06:59:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108164 states. [2019-09-10 06:59:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108164 to 74786. [2019-09-10 06:59:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74786 states. [2019-09-10 06:59:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74786 states to 74786 states and 105830 transitions. [2019-09-10 06:59:28,332 INFO L78 Accepts]: Start accepts. Automaton has 74786 states and 105830 transitions. Word has length 81 [2019-09-10 06:59:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:28,332 INFO L475 AbstractCegarLoop]: Abstraction has 74786 states and 105830 transitions. [2019-09-10 06:59:28,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 74786 states and 105830 transitions. [2019-09-10 06:59:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:59:28,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:28,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:28,336 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 382458760, now seen corresponding path program 1 times [2019-09-10 06:59:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:28,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:28,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:29,758 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 06:59:29,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:29,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:59:29,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:29,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:59:29,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:59:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:59:29,759 INFO L87 Difference]: Start difference. First operand 74786 states and 105830 transitions. Second operand 21 states. [2019-09-10 06:59:30,608 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:59:30,811 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-10 06:59:31,209 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:59:31,610 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 06:59:31,804 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:59:32,165 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 06:59:32,586 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2019-09-10 06:59:32,986 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2019-09-10 06:59:33,442 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 06:59:34,123 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 06:59:38,038 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 06:59:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:40,662 INFO L93 Difference]: Finished difference Result 103041 states and 145386 transitions. [2019-09-10 06:59:40,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:59:40,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2019-09-10 06:59:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:40,790 INFO L225 Difference]: With dead ends: 103041 [2019-09-10 06:59:40,791 INFO L226 Difference]: Without dead ends: 103041 [2019-09-10 06:59:40,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=322, Invalid=1400, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:59:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103041 states. [2019-09-10 06:59:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103041 to 74804. [2019-09-10 06:59:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74804 states. [2019-09-10 06:59:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74804 states to 74804 states and 105854 transitions. [2019-09-10 06:59:41,769 INFO L78 Accepts]: Start accepts. Automaton has 74804 states and 105854 transitions. Word has length 82 [2019-09-10 06:59:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:41,770 INFO L475 AbstractCegarLoop]: Abstraction has 74804 states and 105854 transitions. [2019-09-10 06:59:41,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:59:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 74804 states and 105854 transitions. [2019-09-10 06:59:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:59:41,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:41,774 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 06:59:41,774 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash 460321715, now seen corresponding path program 1 times [2019-09-10 06:59:41,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:41,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:41,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:42,753 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 06:59:42,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:42,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:59:42,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:42,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:59:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:59:42,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:59:42,755 INFO L87 Difference]: Start difference. First operand 74804 states and 105854 transitions. Second operand 18 states. [2019-09-10 06:59:43,065 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-09-10 06:59:43,835 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 06:59:44,008 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:59:44,249 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 06:59:44,594 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:59:45,852 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:59:46,418 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 06:59:46,949 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 06:59:47,739 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 06:59:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:51,017 INFO L93 Difference]: Finished difference Result 174846 states and 247358 transitions. [2019-09-10 06:59:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:59:51,017 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2019-09-10 06:59:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:51,219 INFO L225 Difference]: With dead ends: 174846 [2019-09-10 06:59:51,219 INFO L226 Difference]: Without dead ends: 174846 [2019-09-10 06:59:51,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=376, Invalid=1516, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:59:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174846 states. [2019-09-10 06:59:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174846 to 74786. [2019-09-10 06:59:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74786 states. [2019-09-10 06:59:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74786 states to 74786 states and 105832 transitions. [2019-09-10 06:59:52,528 INFO L78 Accepts]: Start accepts. Automaton has 74786 states and 105832 transitions. Word has length 83 [2019-09-10 06:59:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:52,528 INFO L475 AbstractCegarLoop]: Abstraction has 74786 states and 105832 transitions. [2019-09-10 06:59:52,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:59:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 74786 states and 105832 transitions. [2019-09-10 06:59:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:59:52,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:52,532 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 06:59:52,532 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:52,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1220967375, now seen corresponding path program 1 times [2019-09-10 06:59:52,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:52,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:52,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:52,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:54,444 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-09-10 06:59:55,033 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 06:59:55,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:55,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:59:55,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:55,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:59:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:59:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:59:55,035 INFO L87 Difference]: Start difference. First operand 74786 states and 105832 transitions. Second operand 18 states. [2019-09-10 06:59:55,637 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 06:59:55,845 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:59:56,120 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 06:59:56,363 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:59:57,347 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 06:59:57,789 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:59:58,027 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:59:58,217 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:00:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:00,138 INFO L93 Difference]: Finished difference Result 97769 states and 137994 transitions. [2019-09-10 07:00:00,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:00:00,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2019-09-10 07:00:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:00,242 INFO L225 Difference]: With dead ends: 97769 [2019-09-10 07:00:00,242 INFO L226 Difference]: Without dead ends: 97769 [2019-09-10 07:00:00,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=293, Invalid=1039, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:00:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97769 states. [2019-09-10 07:00:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97769 to 74752. [2019-09-10 07:00:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74752 states. [2019-09-10 07:00:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74752 states to 74752 states and 105791 transitions. [2019-09-10 07:00:01,118 INFO L78 Accepts]: Start accepts. Automaton has 74752 states and 105791 transitions. Word has length 83 [2019-09-10 07:00:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:01,118 INFO L475 AbstractCegarLoop]: Abstraction has 74752 states and 105791 transitions. [2019-09-10 07:00:01,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:00:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 74752 states and 105791 transitions. [2019-09-10 07:00:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:01,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:01,122 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:00:01,122 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -816575180, now seen corresponding path program 1 times [2019-09-10 07:00:01,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:01,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:01,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:01,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:00:01,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:01,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:00:01,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:01,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:00:01,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:00:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:00:01,989 INFO L87 Difference]: Start difference. First operand 74752 states and 105791 transitions. Second operand 17 states. [2019-09-10 07:00:02,575 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 07:00:02,726 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-09-10 07:00:03,221 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:00:03,458 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-09-10 07:00:03,638 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:00:03,887 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:00:04,319 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:00:04,485 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:00:04,663 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:00:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:07,519 INFO L93 Difference]: Finished difference Result 97732 states and 137940 transitions. [2019-09-10 07:00:07,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:00:07,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 83 [2019-09-10 07:00:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:07,622 INFO L225 Difference]: With dead ends: 97732 [2019-09-10 07:00:07,622 INFO L226 Difference]: Without dead ends: 97732 [2019-09-10 07:00:07,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:00:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97732 states. [2019-09-10 07:00:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97732 to 74630. [2019-09-10 07:00:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74630 states. [2019-09-10 07:00:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74630 states to 74630 states and 105640 transitions. [2019-09-10 07:00:08,568 INFO L78 Accepts]: Start accepts. Automaton has 74630 states and 105640 transitions. Word has length 83 [2019-09-10 07:00:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:08,569 INFO L475 AbstractCegarLoop]: Abstraction has 74630 states and 105640 transitions. [2019-09-10 07:00:08,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:00:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 74630 states and 105640 transitions. [2019-09-10 07:00:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:08,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:08,573 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:00:08,574 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash 340889956, now seen corresponding path program 1 times [2019-09-10 07:00:08,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:08,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:08,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:09,151 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:00:09,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:09,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:00:09,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:09,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:00:09,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:00:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:00:09,153 INFO L87 Difference]: Start difference. First operand 74630 states and 105640 transitions. Second operand 12 states. [2019-09-10 07:00:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:11,449 INFO L93 Difference]: Finished difference Result 130765 states and 184978 transitions. [2019-09-10 07:00:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:00:11,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-10 07:00:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:11,612 INFO L225 Difference]: With dead ends: 130765 [2019-09-10 07:00:11,613 INFO L226 Difference]: Without dead ends: 130765 [2019-09-10 07:00:11,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:00:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130765 states. [2019-09-10 07:00:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130765 to 74594. [2019-09-10 07:00:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74594 states. [2019-09-10 07:00:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74594 states to 74594 states and 105594 transitions. [2019-09-10 07:00:13,211 INFO L78 Accepts]: Start accepts. Automaton has 74594 states and 105594 transitions. Word has length 83 [2019-09-10 07:00:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:13,211 INFO L475 AbstractCegarLoop]: Abstraction has 74594 states and 105594 transitions. [2019-09-10 07:00:13,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:00:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 74594 states and 105594 transitions. [2019-09-10 07:00:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:00:13,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:13,215 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:00:13,215 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:13,215 INFO L82 PathProgramCache]: Analyzing trace with hash 625119211, now seen corresponding path program 1 times [2019-09-10 07:00:13,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:13,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:13,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:13,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:13,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:13,748 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:00:13,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:13,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:00:13,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:13,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:00:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:00:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:00:13,749 INFO L87 Difference]: Start difference. First operand 74594 states and 105594 transitions. Second operand 12 states. [2019-09-10 07:00:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:15,640 INFO L93 Difference]: Finished difference Result 161312 states and 228580 transitions. [2019-09-10 07:00:15,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:00:15,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2019-09-10 07:00:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:15,823 INFO L225 Difference]: With dead ends: 161312 [2019-09-10 07:00:15,824 INFO L226 Difference]: Without dead ends: 161312 [2019-09-10 07:00:15,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:00:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161312 states. [2019-09-10 07:00:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161312 to 74593. [2019-09-10 07:00:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74593 states. [2019-09-10 07:00:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74593 states to 74593 states and 105592 transitions. [2019-09-10 07:00:16,983 INFO L78 Accepts]: Start accepts. Automaton has 74593 states and 105592 transitions. Word has length 84 [2019-09-10 07:00:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:16,983 INFO L475 AbstractCegarLoop]: Abstraction has 74593 states and 105592 transitions. [2019-09-10 07:00:16,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:00:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 74593 states and 105592 transitions. [2019-09-10 07:00:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:00:16,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:16,987 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:00:16,988 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash 536769961, now seen corresponding path program 1 times [2019-09-10 07:00:16,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:16,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:17,965 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:00:17,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:17,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:00:17,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:17,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:00:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:00:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:00:17,966 INFO L87 Difference]: Start difference. First operand 74593 states and 105592 transitions. Second operand 17 states. [2019-09-10 07:00:18,634 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 07:00:18,775 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:00:18,984 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:00:19,238 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:00:19,994 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:00:20,416 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:00:20,689 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:00:21,011 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:00:21,334 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:00:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:25,109 INFO L93 Difference]: Finished difference Result 219463 states and 310753 transitions. [2019-09-10 07:00:25,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:00:25,110 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2019-09-10 07:00:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:25,393 INFO L225 Difference]: With dead ends: 219463 [2019-09-10 07:00:25,393 INFO L226 Difference]: Without dead ends: 219463 [2019-09-10 07:00:25,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:00:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219463 states. [2019-09-10 07:00:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219463 to 74580. [2019-09-10 07:00:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74580 states. [2019-09-10 07:00:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74580 states to 74580 states and 105576 transitions. [2019-09-10 07:00:27,019 INFO L78 Accepts]: Start accepts. Automaton has 74580 states and 105576 transitions. Word has length 84 [2019-09-10 07:00:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:27,019 INFO L475 AbstractCegarLoop]: Abstraction has 74580 states and 105576 transitions. [2019-09-10 07:00:27,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:00:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 74580 states and 105576 transitions. [2019-09-10 07:00:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:00:27,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:27,023 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:00:27,023 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash 379635451, now seen corresponding path program 1 times [2019-09-10 07:00:27,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:27,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:27,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:27,749 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:00:27,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:27,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:00:27,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:27,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:00:27,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:00:27,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:00:27,751 INFO L87 Difference]: Start difference. First operand 74580 states and 105576 transitions. Second operand 15 states. [2019-09-10 07:00:28,520 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 07:00:28,701 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:00:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:31,573 INFO L93 Difference]: Finished difference Result 130670 states and 184864 transitions. [2019-09-10 07:00:31,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:00:31,574 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2019-09-10 07:00:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:31,698 INFO L225 Difference]: With dead ends: 130670 [2019-09-10 07:00:31,698 INFO L226 Difference]: Without dead ends: 130670 [2019-09-10 07:00:31,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:00:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130670 states. [2019-09-10 07:00:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130670 to 74578. [2019-09-10 07:00:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74578 states. [2019-09-10 07:00:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74578 states to 74578 states and 105572 transitions. [2019-09-10 07:00:32,695 INFO L78 Accepts]: Start accepts. Automaton has 74578 states and 105572 transitions. Word has length 84 [2019-09-10 07:00:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:32,695 INFO L475 AbstractCegarLoop]: Abstraction has 74578 states and 105572 transitions. [2019-09-10 07:00:32,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:00:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 74578 states and 105572 transitions. [2019-09-10 07:00:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:00:32,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:32,699 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:00:32,699 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -772171443, now seen corresponding path program 1 times [2019-09-10 07:00:32,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:32,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:32,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:32,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:32,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:32,803 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:00:32,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:32,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:00:32,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:32,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:00:32,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:00:32,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:00:32,805 INFO L87 Difference]: Start difference. First operand 74578 states and 105572 transitions. Second operand 7 states. [2019-09-10 07:00:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:33,761 INFO L93 Difference]: Finished difference Result 340672 states and 471763 transitions. [2019-09-10 07:00:33,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:00:33,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-10 07:00:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:34,192 INFO L225 Difference]: With dead ends: 340672 [2019-09-10 07:00:34,192 INFO L226 Difference]: Without dead ends: 340672 [2019-09-10 07:00:34,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:00:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340672 states. [2019-09-10 07:00:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340672 to 262888. [2019-09-10 07:00:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262888 states. [2019-09-10 07:00:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262888 states to 262888 states and 364633 transitions. [2019-09-10 07:00:40,627 INFO L78 Accepts]: Start accepts. Automaton has 262888 states and 364633 transitions. Word has length 84 [2019-09-10 07:00:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:40,628 INFO L475 AbstractCegarLoop]: Abstraction has 262888 states and 364633 transitions. [2019-09-10 07:00:40,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:00:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 262888 states and 364633 transitions. [2019-09-10 07:00:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:00:40,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:40,633 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:00:40,633 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:40,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1402693335, now seen corresponding path program 1 times [2019-09-10 07:00:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:40,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:44,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:44,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:44,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:44,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:44,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:44,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:44,039 INFO L87 Difference]: Start difference. First operand 262888 states and 364633 transitions. Second operand 6 states. [2019-09-10 07:00:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:44,813 INFO L93 Difference]: Finished difference Result 169026 states and 230272 transitions. [2019-09-10 07:00:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:00:44,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-10 07:00:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:45,029 INFO L225 Difference]: With dead ends: 169026 [2019-09-10 07:00:45,029 INFO L226 Difference]: Without dead ends: 169026 [2019-09-10 07:00:45,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169026 states. [2019-09-10 07:00:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169026 to 126275. [2019-09-10 07:00:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126275 states. [2019-09-10 07:00:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126275 states to 126275 states and 172440 transitions. [2019-09-10 07:00:46,585 INFO L78 Accepts]: Start accepts. Automaton has 126275 states and 172440 transitions. Word has length 85 [2019-09-10 07:00:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:46,585 INFO L475 AbstractCegarLoop]: Abstraction has 126275 states and 172440 transitions. [2019-09-10 07:00:46,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 126275 states and 172440 transitions. [2019-09-10 07:00:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:00:46,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:46,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:46,593 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1476132476, now seen corresponding path program 1 times [2019-09-10 07:00:46,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:46,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:46,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:46,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:46,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:46,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:46,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:46,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:46,707 INFO L87 Difference]: Start difference. First operand 126275 states and 172440 transitions. Second operand 6 states. [2019-09-10 07:00:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:47,786 INFO L93 Difference]: Finished difference Result 221660 states and 298741 transitions. [2019-09-10 07:00:47,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:00:47,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-10 07:00:47,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:48,024 INFO L225 Difference]: With dead ends: 221660 [2019-09-10 07:00:48,024 INFO L226 Difference]: Without dead ends: 221660 [2019-09-10 07:00:48,024 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:00:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221660 states. [2019-09-10 07:00:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221660 to 129491. [2019-09-10 07:00:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129491 states. [2019-09-10 07:00:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129491 states to 129491 states and 174949 transitions. [2019-09-10 07:00:49,837 INFO L78 Accepts]: Start accepts. Automaton has 129491 states and 174949 transitions. Word has length 87 [2019-09-10 07:00:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:49,837 INFO L475 AbstractCegarLoop]: Abstraction has 129491 states and 174949 transitions. [2019-09-10 07:00:49,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 129491 states and 174949 transitions. [2019-09-10 07:00:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:00:49,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:49,843 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:00:49,843 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1478427296, now seen corresponding path program 1 times [2019-09-10 07:00:49,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:49,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:49,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:49,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:49,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:50,437 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:00:50,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:50,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:50,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:50,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:50,439 INFO L87 Difference]: Start difference. First operand 129491 states and 174949 transitions. Second operand 3 states. [2019-09-10 07:00:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:50,937 INFO L93 Difference]: Finished difference Result 233724 states and 313547 transitions. [2019-09-10 07:00:50,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:50,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:00:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:51,200 INFO L225 Difference]: With dead ends: 233724 [2019-09-10 07:00:51,200 INFO L226 Difference]: Without dead ends: 233724 [2019-09-10 07:00:51,200 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:00:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233724 states. [2019-09-10 07:00:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233724 to 233722. [2019-09-10 07:00:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233722 states. [2019-09-10 07:00:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233722 states to 233722 states and 313546 transitions. [2019-09-10 07:00:54,256 INFO L78 Accepts]: Start accepts. Automaton has 233722 states and 313546 transitions. Word has length 88 [2019-09-10 07:00:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:54,256 INFO L475 AbstractCegarLoop]: Abstraction has 233722 states and 313546 transitions. [2019-09-10 07:00:54,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 233722 states and 313546 transitions. [2019-09-10 07:00:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:00:54,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:54,264 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:00:54,264 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:54,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1576523976, now seen corresponding path program 1 times [2019-09-10 07:00:54,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:54,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:54,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:54,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:54,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:54,334 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:00:54,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:54,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:00:54,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:54,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:00:54,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:00:54,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:00:54,335 INFO L87 Difference]: Start difference. First operand 233722 states and 313546 transitions. Second operand 5 states. [2019-09-10 07:00:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:58,167 INFO L93 Difference]: Finished difference Result 660552 states and 875511 transitions. [2019-09-10 07:00:58,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:00:58,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 07:00:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:59,155 INFO L225 Difference]: With dead ends: 660552 [2019-09-10 07:00:59,156 INFO L226 Difference]: Without dead ends: 660552 [2019-09-10 07:00:59,156 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:00:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660552 states. [2019-09-10 07:01:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660552 to 407739. [2019-09-10 07:01:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407739 states. [2019-09-10 07:01:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407739 states to 407739 states and 541986 transitions. [2019-09-10 07:01:12,950 INFO L78 Accepts]: Start accepts. Automaton has 407739 states and 541986 transitions. Word has length 89 [2019-09-10 07:01:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:12,950 INFO L475 AbstractCegarLoop]: Abstraction has 407739 states and 541986 transitions. [2019-09-10 07:01:12,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 407739 states and 541986 transitions. [2019-09-10 07:01:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:01:12,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:12,960 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:01:12,961 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash 596475685, now seen corresponding path program 1 times [2019-09-10 07:01:12,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:12,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:12,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:12,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:12,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:13,053 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:01:13,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:13,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:13,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:13,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:13,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:13,055 INFO L87 Difference]: Start difference. First operand 407739 states and 541986 transitions. Second operand 5 states. [2019-09-10 07:01:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:16,649 INFO L93 Difference]: Finished difference Result 684795 states and 897653 transitions. [2019-09-10 07:01:16,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:01:16,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 07:01:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:17,532 INFO L225 Difference]: With dead ends: 684795 [2019-09-10 07:01:17,532 INFO L226 Difference]: Without dead ends: 684795 [2019-09-10 07:01:17,532 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:01:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684795 states. [2019-09-10 07:01:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684795 to 460684. [2019-09-10 07:01:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460684 states. [2019-09-10 07:01:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460684 states to 460684 states and 603455 transitions. [2019-09-10 07:01:33,342 INFO L78 Accepts]: Start accepts. Automaton has 460684 states and 603455 transitions. Word has length 93 [2019-09-10 07:01:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:33,342 INFO L475 AbstractCegarLoop]: Abstraction has 460684 states and 603455 transitions. [2019-09-10 07:01:33,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 460684 states and 603455 transitions. [2019-09-10 07:01:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:01:33,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:33,350 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:01:33,351 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1783782911, now seen corresponding path program 1 times [2019-09-10 07:01:33,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:33,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:33,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:33,440 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:01:33,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:33,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:33,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:33,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:33,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:33,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:33,442 INFO L87 Difference]: Start difference. First operand 460684 states and 603455 transitions. Second operand 5 states. [2019-09-10 07:01:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:38,558 INFO L93 Difference]: Finished difference Result 1114857 states and 1439955 transitions. [2019-09-10 07:01:38,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:01:38,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 07:01:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:50,123 INFO L225 Difference]: With dead ends: 1114857 [2019-09-10 07:01:50,123 INFO L226 Difference]: Without dead ends: 1114857 [2019-09-10 07:01:50,124 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:01:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114857 states. [2019-09-10 07:02:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114857 to 764431. [2019-09-10 07:02:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764431 states. [2019-09-10 07:02:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764431 states to 764431 states and 997689 transitions. [2019-09-10 07:02:13,346 INFO L78 Accepts]: Start accepts. Automaton has 764431 states and 997689 transitions. Word has length 93 [2019-09-10 07:02:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:13,346 INFO L475 AbstractCegarLoop]: Abstraction has 764431 states and 997689 transitions. [2019-09-10 07:02:13,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:02:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 764431 states and 997689 transitions. [2019-09-10 07:02:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:02:13,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:13,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:13,359 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1196052920, now seen corresponding path program 1 times [2019-09-10 07:02:13,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:13,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:13,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:13,443 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:02:13,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:13,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:13,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:13,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:13,445 INFO L87 Difference]: Start difference. First operand 764431 states and 997689 transitions. Second operand 3 states. [2019-09-10 07:02:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:23,846 INFO L93 Difference]: Finished difference Result 860587 states and 1103578 transitions. [2019-09-10 07:02:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:23,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:02:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:25,225 INFO L225 Difference]: With dead ends: 860587 [2019-09-10 07:02:25,225 INFO L226 Difference]: Without dead ends: 860587 [2019-09-10 07:02:25,225 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:02:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860587 states. [2019-09-10 07:02:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860587 to 674919. [2019-09-10 07:02:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674919 states. [2019-09-10 07:02:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674919 states to 674919 states and 868726 transitions. [2019-09-10 07:02:45,902 INFO L78 Accepts]: Start accepts. Automaton has 674919 states and 868726 transitions. Word has length 99 [2019-09-10 07:02:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:45,902 INFO L475 AbstractCegarLoop]: Abstraction has 674919 states and 868726 transitions. [2019-09-10 07:02:45,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 674919 states and 868726 transitions. [2019-09-10 07:02:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:02:45,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:45,912 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1707782847, now seen corresponding path program 1 times [2019-09-10 07:02:45,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:45,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:45,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:45,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:45,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:45,970 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:02:45,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:45,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:45,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:45,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:45,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:45,971 INFO L87 Difference]: Start difference. First operand 674919 states and 868726 transitions. Second operand 3 states. [2019-09-10 07:02:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:49,228 INFO L93 Difference]: Finished difference Result 663153 states and 840869 transitions. [2019-09-10 07:02:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:49,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:02:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:50,061 INFO L225 Difference]: With dead ends: 663153 [2019-09-10 07:02:50,061 INFO L226 Difference]: Without dead ends: 663153 [2019-09-10 07:02:50,062 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:02:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663153 states. [2019-09-10 07:03:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663153 to 661967. [2019-09-10 07:03:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661967 states. [2019-09-10 07:03:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661967 states to 661967 states and 839684 transitions. [2019-09-10 07:03:09,612 INFO L78 Accepts]: Start accepts. Automaton has 661967 states and 839684 transitions. Word has length 102 [2019-09-10 07:03:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:09,612 INFO L475 AbstractCegarLoop]: Abstraction has 661967 states and 839684 transitions. [2019-09-10 07:03:09,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 661967 states and 839684 transitions. [2019-09-10 07:03:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:03:09,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:09,641 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:09,641 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 240687738, now seen corresponding path program 1 times [2019-09-10 07:03:09,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:09,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:09,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:09,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:09,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:09,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:09,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:09,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:09,726 INFO L87 Difference]: Start difference. First operand 661967 states and 839684 transitions. Second operand 3 states. [2019-09-10 07:03:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:20,757 INFO L93 Difference]: Finished difference Result 1188704 states and 1483136 transitions. [2019-09-10 07:03:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:20,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 07:03:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:22,513 INFO L225 Difference]: With dead ends: 1188704 [2019-09-10 07:03:22,514 INFO L226 Difference]: Without dead ends: 1188704 [2019-09-10 07:03:22,514 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:03:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188704 states. [2019-09-10 07:03:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188704 to 1096692. [2019-09-10 07:03:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096692 states. [2019-09-10 07:03:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096692 states to 1096692 states and 1366591 transitions. [2019-09-10 07:03:58,165 INFO L78 Accepts]: Start accepts. Automaton has 1096692 states and 1366591 transitions. Word has length 120 [2019-09-10 07:03:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:58,165 INFO L475 AbstractCegarLoop]: Abstraction has 1096692 states and 1366591 transitions. [2019-09-10 07:03:58,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1096692 states and 1366591 transitions. [2019-09-10 07:03:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 07:03:58,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:58,195 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:58,195 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash -936387104, now seen corresponding path program 1 times [2019-09-10 07:03:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:58,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:58,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:58,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:58,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:03:58,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2019-09-10 07:03:58,318 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [82], [233], [379], [382], [385], [387], [392], [397], [1959], [1962], [1963], [1965], [2362], [2364], [2367], [2369], [2372], [2393], [2395], [2397], [4789], [4793], [5962], [5965], [5986], [5988], [5990], [5992], [5995], [6016], [6018], [6020], [6023], [6044], [6046], [6048], [6050], [6069], [6071], [6090], [6092], [6095], [6098], [6101], [6109], [6111], [6868], [6882], [6884], [6888], [6891], [6894], [6897], [6901], [7018], [7034], [7037], [7040], [7044], [7047], [7050], [7054], [7057], [7061], [7064], [7068], [7071], [7080], [7082], [7283], [7286], [7289], [7293], [7296], [7300], [7304], [7306], [7310], [7314], [7333], [7335], [7834], [7835], [7839], [7840], [7841] [2019-09-10 07:03:58,362 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:03:58,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:03:58,681 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:03:59,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:03:59,484 INFO L272 AbstractInterpreter]: Visited 113 different actions 475 times. Merged at 43 different actions 329 times. Widened at 22 different actions 60 times. Performed 2318 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2318 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 26 fixpoints after 11 different actions. Largest state had 499 variables. [2019-09-10 07:03:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:59,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:03:59,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:59,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:03:59,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:59,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:03:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:59,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 2631 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 07:03:59,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:03:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:04:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:00,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:04:00,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:04:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-10 07:04:00,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:04:00,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-09-10 07:04:00,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:04:00,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:04:00,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:04:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:04:00,640 INFO L87 Difference]: Start difference. First operand 1096692 states and 1366591 transitions. Second operand 13 states. [2019-09-10 07:04:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:41,799 INFO L93 Difference]: Finished difference Result 3454392 states and 4279405 transitions. [2019-09-10 07:04:41,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 07:04:41,799 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 121 [2019-09-10 07:04:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:48,653 INFO L225 Difference]: With dead ends: 3454392 [2019-09-10 07:04:48,654 INFO L226 Difference]: Without dead ends: 3454392 [2019-09-10 07:04:48,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2262 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1528, Invalid=5612, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 07:04:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454392 states.