java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:13:19,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:13:19,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:13:19,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:13:19,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:13:19,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:13:19,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:13:19,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:13:19,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:13:19,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:13:19,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:13:19,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:13:19,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:13:19,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:13:19,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:13:19,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:13:19,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:13:19,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:13:19,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:13:19,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:13:19,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:13:19,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:13:19,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:13:19,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:13:19,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:13:19,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:13:19,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:13:19,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:13:19,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:13:19,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:13:19,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:13:19,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:13:19,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:13:19,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:13:19,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:13:19,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:13:19,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:13:19,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:13:19,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:13:19,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:13:19,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:13:19,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:13:19,871 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:13:19,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:13:19,872 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:13:19,872 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:13:19,873 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:13:19,873 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:13:19,873 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:13:19,873 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:13:19,873 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:13:19,874 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:13:19,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:13:19,875 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:13:19,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:13:19,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:13:19,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:13:19,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:13:19,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:13:19,876 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:13:19,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:13:19,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:13:19,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:13:19,877 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:13:19,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:13:19,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:13:19,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:13:19,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:13:19,878 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:13:19,878 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:13:19,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:13:19,878 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:13:19,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:13:19,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:13:19,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:13:19,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:13:19,928 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:13:19,929 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:13:19,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c16a1f0/ab06936469424273b287041e433a4602/FLAG2097b3c31 [2019-09-10 07:13:20,520 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:13:20,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:13:20,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c16a1f0/ab06936469424273b287041e433a4602/FLAG2097b3c31 [2019-09-10 07:13:20,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c16a1f0/ab06936469424273b287041e433a4602 [2019-09-10 07:13:20,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:13:20,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:13:20,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:20,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:13:20,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:13:20,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:20" (1/1) ... [2019-09-10 07:13:20,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca16317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:20, skipping insertion in model container [2019-09-10 07:13:20,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:20" (1/1) ... [2019-09-10 07:13:20,841 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:13:20,896 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:13:21,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:21,377 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:13:21,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:21,538 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:13:21,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21 WrapperNode [2019-09-10 07:13:21,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:21,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:13:21,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:13:21,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:13:21,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:13:21,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:13:21,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:13:21,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:13:21,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:13:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:13:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:13:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:13:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:13:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:13:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:13:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:13:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:13:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:13:21,717 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:13:21,717 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:13:21,718 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:13:21,718 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:13:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:13:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:13:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:13:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:13:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:13:21,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:13:21,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:13:21,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:13:23,002 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:13:23,003 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:13:23,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:23 BoogieIcfgContainer [2019-09-10 07:13:23,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:13:23,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:13:23,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:13:23,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:13:23,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:13:20" (1/3) ... [2019-09-10 07:13:23,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8a415c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:23, skipping insertion in model container [2019-09-10 07:13:23,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21" (2/3) ... [2019-09-10 07:13:23,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8a415c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:23, skipping insertion in model container [2019-09-10 07:13:23,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:23" (3/3) ... [2019-09-10 07:13:23,014 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:13:23,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:13:23,034 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:13:23,052 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:13:23,081 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:13:23,081 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:13:23,081 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:13:23,082 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:13:23,082 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:13:23,082 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:13:23,083 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:13:23,083 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:13:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-09-10 07:13:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:13:23,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:23,126 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:13:23,128 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash 777422935, now seen corresponding path program 1 times [2019-09-10 07:13:23,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:23,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:23,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:23,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:23,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:23,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:23,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:23,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:23,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:23,712 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 3 states. [2019-09-10 07:13:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:23,846 INFO L93 Difference]: Finished difference Result 326 states and 537 transitions. [2019-09-10 07:13:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:23,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:13:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:23,866 INFO L225 Difference]: With dead ends: 326 [2019-09-10 07:13:23,866 INFO L226 Difference]: Without dead ends: 318 [2019-09-10 07:13:23,868 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:13:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-10 07:13:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2019-09-10 07:13:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 07:13:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2019-09-10 07:13:23,939 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 83 [2019-09-10 07:13:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:23,940 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2019-09-10 07:13:23,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2019-09-10 07:13:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:13:23,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:23,944 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:13:23,945 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1931111446, now seen corresponding path program 1 times [2019-09-10 07:13:23,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:23,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:23,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:23,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:23,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:24,348 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:13:24,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:24,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:24,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:24,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:24,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:24,353 INFO L87 Difference]: Start difference. First operand 316 states and 472 transitions. Second operand 7 states. [2019-09-10 07:13:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:24,705 INFO L93 Difference]: Finished difference Result 1126 states and 1729 transitions. [2019-09-10 07:13:24,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:13:24,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-10 07:13:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:24,714 INFO L225 Difference]: With dead ends: 1126 [2019-09-10 07:13:24,714 INFO L226 Difference]: Without dead ends: 1126 [2019-09-10 07:13:24,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-10 07:13:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1118. [2019-09-10 07:13:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-09-10 07:13:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1725 transitions. [2019-09-10 07:13:24,787 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1725 transitions. Word has length 84 [2019-09-10 07:13:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:24,788 INFO L475 AbstractCegarLoop]: Abstraction has 1118 states and 1725 transitions. [2019-09-10 07:13:24,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1725 transitions. [2019-09-10 07:13:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:13:24,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:24,802 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:13:24,802 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1862792065, now seen corresponding path program 1 times [2019-09-10 07:13:24,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:24,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:24,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:24,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 07:13:24,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:24,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:24,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:24,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:24,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:24,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:24,993 INFO L87 Difference]: Start difference. First operand 1118 states and 1725 transitions. Second operand 5 states. [2019-09-10 07:13:25,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:25,388 INFO L93 Difference]: Finished difference Result 1878 states and 2914 transitions. [2019-09-10 07:13:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:25,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:13:25,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:25,402 INFO L225 Difference]: With dead ends: 1878 [2019-09-10 07:13:25,402 INFO L226 Difference]: Without dead ends: 1878 [2019-09-10 07:13:25,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-09-10 07:13:25,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1876. [2019-09-10 07:13:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2019-09-10 07:13:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2913 transitions. [2019-09-10 07:13:25,465 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2913 transitions. Word has length 85 [2019-09-10 07:13:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:25,466 INFO L475 AbstractCegarLoop]: Abstraction has 1876 states and 2913 transitions. [2019-09-10 07:13:25,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2913 transitions. [2019-09-10 07:13:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:13:25,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:25,471 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:13:25,472 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:25,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:25,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1893816110, now seen corresponding path program 1 times [2019-09-10 07:13:25,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:25,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:25,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:25,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:25,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:25,576 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:13:25,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:25,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:25,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:25,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:25,578 INFO L87 Difference]: Start difference. First operand 1876 states and 2913 transitions. Second operand 5 states. [2019-09-10 07:13:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:25,952 INFO L93 Difference]: Finished difference Result 3378 states and 5271 transitions. [2019-09-10 07:13:25,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:25,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:13:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:25,971 INFO L225 Difference]: With dead ends: 3378 [2019-09-10 07:13:25,972 INFO L226 Difference]: Without dead ends: 3378 [2019-09-10 07:13:25,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3378 states. [2019-09-10 07:13:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3378 to 3376. [2019-09-10 07:13:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3376 states. [2019-09-10 07:13:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 5270 transitions. [2019-09-10 07:13:26,067 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 5270 transitions. Word has length 85 [2019-09-10 07:13:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:26,068 INFO L475 AbstractCegarLoop]: Abstraction has 3376 states and 5270 transitions. [2019-09-10 07:13:26,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 5270 transitions. [2019-09-10 07:13:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:13:26,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:26,071 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:13:26,071 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash 331647536, now seen corresponding path program 1 times [2019-09-10 07:13:26,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:26,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:26,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:26,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:26,168 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:13:26,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:26,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:26,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:26,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:26,171 INFO L87 Difference]: Start difference. First operand 3376 states and 5270 transitions. Second operand 5 states. [2019-09-10 07:13:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:26,525 INFO L93 Difference]: Finished difference Result 6432 states and 10033 transitions. [2019-09-10 07:13:26,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:26,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:13:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:26,595 INFO L225 Difference]: With dead ends: 6432 [2019-09-10 07:13:26,596 INFO L226 Difference]: Without dead ends: 6432 [2019-09-10 07:13:26,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2019-09-10 07:13:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 6430. [2019-09-10 07:13:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6430 states. [2019-09-10 07:13:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 10032 transitions. [2019-09-10 07:13:26,782 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 10032 transitions. Word has length 85 [2019-09-10 07:13:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:26,783 INFO L475 AbstractCegarLoop]: Abstraction has 6430 states and 10032 transitions. [2019-09-10 07:13:26,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 10032 transitions. [2019-09-10 07:13:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:13:26,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:26,787 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:13:26,787 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1849994463, now seen corresponding path program 1 times [2019-09-10 07:13:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:26,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:26,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:26,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:26,960 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:13:26,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:26,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:13:26,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:26,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:13:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:13:26,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:13:26,963 INFO L87 Difference]: Start difference. First operand 6430 states and 10032 transitions. Second operand 6 states. [2019-09-10 07:13:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:27,524 INFO L93 Difference]: Finished difference Result 18266 states and 28423 transitions. [2019-09-10 07:13:27,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:27,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-10 07:13:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:27,638 INFO L225 Difference]: With dead ends: 18266 [2019-09-10 07:13:27,638 INFO L226 Difference]: Without dead ends: 18266 [2019-09-10 07:13:27,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:13:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18266 states. [2019-09-10 07:13:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18266 to 18262. [2019-09-10 07:13:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18262 states. [2019-09-10 07:13:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18262 states to 18262 states and 28421 transitions. [2019-09-10 07:13:28,092 INFO L78 Accepts]: Start accepts. Automaton has 18262 states and 28421 transitions. Word has length 85 [2019-09-10 07:13:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:28,093 INFO L475 AbstractCegarLoop]: Abstraction has 18262 states and 28421 transitions. [2019-09-10 07:13:28,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:13:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 18262 states and 28421 transitions. [2019-09-10 07:13:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:13:28,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:28,106 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:28,116 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:28,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1516640680, now seen corresponding path program 1 times [2019-09-10 07:13:28,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:28,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:28,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:28,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:28,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:28,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:28,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:28,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:28,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:28,248 INFO L87 Difference]: Start difference. First operand 18262 states and 28421 transitions. Second operand 5 states. [2019-09-10 07:13:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:28,793 INFO L93 Difference]: Finished difference Result 33014 states and 51193 transitions. [2019-09-10 07:13:28,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:28,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:13:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:28,877 INFO L225 Difference]: With dead ends: 33014 [2019-09-10 07:13:28,877 INFO L226 Difference]: Without dead ends: 33014 [2019-09-10 07:13:28,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33014 states. [2019-09-10 07:13:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33014 to 33012. [2019-09-10 07:13:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33012 states. [2019-09-10 07:13:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33012 states to 33012 states and 51192 transitions. [2019-09-10 07:13:30,308 INFO L78 Accepts]: Start accepts. Automaton has 33012 states and 51192 transitions. Word has length 86 [2019-09-10 07:13:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:30,309 INFO L475 AbstractCegarLoop]: Abstraction has 33012 states and 51192 transitions. [2019-09-10 07:13:30,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 33012 states and 51192 transitions. [2019-09-10 07:13:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:13:30,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:30,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:30,318 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash -531883147, now seen corresponding path program 1 times [2019-09-10 07:13:30,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:30,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:30,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:30,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:30,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:30,430 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:13:30,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:30,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:30,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:30,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:30,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:30,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:30,432 INFO L87 Difference]: Start difference. First operand 33012 states and 51192 transitions. Second operand 5 states. [2019-09-10 07:13:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:30,677 INFO L93 Difference]: Finished difference Result 62388 states and 96008 transitions. [2019-09-10 07:13:30,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:13:30,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:13:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:30,883 INFO L225 Difference]: With dead ends: 62388 [2019-09-10 07:13:30,884 INFO L226 Difference]: Without dead ends: 62388 [2019-09-10 07:13:30,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:13:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62388 states. [2019-09-10 07:13:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62388 to 33444. [2019-09-10 07:13:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33444 states. [2019-09-10 07:13:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33444 states to 33444 states and 51624 transitions. [2019-09-10 07:13:31,759 INFO L78 Accepts]: Start accepts. Automaton has 33444 states and 51624 transitions. Word has length 86 [2019-09-10 07:13:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:31,760 INFO L475 AbstractCegarLoop]: Abstraction has 33444 states and 51624 transitions. [2019-09-10 07:13:31,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 33444 states and 51624 transitions. [2019-09-10 07:13:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:13:31,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:31,771 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:13:31,771 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash 951832546, now seen corresponding path program 1 times [2019-09-10 07:13:31,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:31,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:31,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:31,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:31,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:32,048 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:13:32,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:32,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:32,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:32,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:32,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:32,050 INFO L87 Difference]: Start difference. First operand 33444 states and 51624 transitions. Second operand 10 states. [2019-09-10 07:13:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:34,556 INFO L93 Difference]: Finished difference Result 101817 states and 154866 transitions. [2019-09-10 07:13:34,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:13:34,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-10 07:13:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:35,119 INFO L225 Difference]: With dead ends: 101817 [2019-09-10 07:13:35,119 INFO L226 Difference]: Without dead ends: 101817 [2019-09-10 07:13:35,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:13:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101817 states. [2019-09-10 07:13:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101817 to 34031. [2019-09-10 07:13:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34031 states. [2019-09-10 07:13:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34031 states to 34031 states and 52489 transitions. [2019-09-10 07:13:36,437 INFO L78 Accepts]: Start accepts. Automaton has 34031 states and 52489 transitions. Word has length 87 [2019-09-10 07:13:36,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:36,438 INFO L475 AbstractCegarLoop]: Abstraction has 34031 states and 52489 transitions. [2019-09-10 07:13:36,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 34031 states and 52489 transitions. [2019-09-10 07:13:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:13:36,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:36,450 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:13:36,450 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash 802753602, now seen corresponding path program 1 times [2019-09-10 07:13:36,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:36,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:36,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:36,683 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:13:36,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:36,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:36,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:36,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:36,687 INFO L87 Difference]: Start difference. First operand 34031 states and 52489 transitions. Second operand 10 states. [2019-09-10 07:13:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:40,331 INFO L93 Difference]: Finished difference Result 174945 states and 268450 transitions. [2019-09-10 07:13:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:13:40,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-10 07:13:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:40,625 INFO L225 Difference]: With dead ends: 174945 [2019-09-10 07:13:40,625 INFO L226 Difference]: Without dead ends: 174945 [2019-09-10 07:13:40,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:13:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174945 states. [2019-09-10 07:13:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174945 to 34031. [2019-09-10 07:13:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34031 states. [2019-09-10 07:13:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34031 states to 34031 states and 52487 transitions. [2019-09-10 07:13:42,117 INFO L78 Accepts]: Start accepts. Automaton has 34031 states and 52487 transitions. Word has length 87 [2019-09-10 07:13:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:42,118 INFO L475 AbstractCegarLoop]: Abstraction has 34031 states and 52487 transitions. [2019-09-10 07:13:42,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 34031 states and 52487 transitions. [2019-09-10 07:13:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:13:42,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:42,131 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:13:42,131 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1048947838, now seen corresponding path program 1 times [2019-09-10 07:13:42,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:42,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:42,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:42,359 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:13:42,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:42,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:42,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:42,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:42,361 INFO L87 Difference]: Start difference. First operand 34031 states and 52487 transitions. Second operand 10 states. [2019-09-10 07:13:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:45,580 INFO L93 Difference]: Finished difference Result 217130 states and 332008 transitions. [2019-09-10 07:13:45,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:13:45,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-10 07:13:45,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:45,950 INFO L225 Difference]: With dead ends: 217130 [2019-09-10 07:13:45,951 INFO L226 Difference]: Without dead ends: 217130 [2019-09-10 07:13:45,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:13:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217130 states. [2019-09-10 07:13:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217130 to 34586. [2019-09-10 07:13:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34586 states. [2019-09-10 07:13:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34586 states to 34586 states and 53229 transitions. [2019-09-10 07:13:49,271 INFO L78 Accepts]: Start accepts. Automaton has 34586 states and 53229 transitions. Word has length 87 [2019-09-10 07:13:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:49,271 INFO L475 AbstractCegarLoop]: Abstraction has 34586 states and 53229 transitions. [2019-09-10 07:13:49,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 34586 states and 53229 transitions. [2019-09-10 07:13:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:13:49,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:49,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:49,282 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1617729314, now seen corresponding path program 1 times [2019-09-10 07:13:49,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:49,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:49,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:49,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:49,506 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:13:49,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:49,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:49,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:49,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:49,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:49,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:49,509 INFO L87 Difference]: Start difference. First operand 34586 states and 53229 transitions. Second operand 10 states. [2019-09-10 07:13:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:53,029 INFO L93 Difference]: Finished difference Result 273814 states and 422490 transitions. [2019-09-10 07:13:53,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:13:53,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-10 07:13:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:53,400 INFO L225 Difference]: With dead ends: 273814 [2019-09-10 07:13:53,401 INFO L226 Difference]: Without dead ends: 273814 [2019-09-10 07:13:53,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:13:53,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273814 states. [2019-09-10 07:13:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273814 to 35075. [2019-09-10 07:13:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35075 states. [2019-09-10 07:13:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35075 states to 35075 states and 53840 transitions. [2019-09-10 07:13:57,147 INFO L78 Accepts]: Start accepts. Automaton has 35075 states and 53840 transitions. Word has length 87 [2019-09-10 07:13:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:57,147 INFO L475 AbstractCegarLoop]: Abstraction has 35075 states and 53840 transitions. [2019-09-10 07:13:57,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 35075 states and 53840 transitions. [2019-09-10 07:13:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:13:57,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:57,157 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:57,157 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1867449764, now seen corresponding path program 1 times [2019-09-10 07:13:57,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:57,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:57,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:57,354 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:13:57,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:57,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:57,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:57,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:57,356 INFO L87 Difference]: Start difference. First operand 35075 states and 53840 transitions. Second operand 10 states. [2019-09-10 07:14:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,443 INFO L93 Difference]: Finished difference Result 183567 states and 281176 transitions. [2019-09-10 07:14:00,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:14:00,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:14:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:00,703 INFO L225 Difference]: With dead ends: 183567 [2019-09-10 07:14:00,704 INFO L226 Difference]: Without dead ends: 183567 [2019-09-10 07:14:00,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:14:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183567 states. [2019-09-10 07:14:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183567 to 35450. [2019-09-10 07:14:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35450 states. [2019-09-10 07:14:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35450 states to 35450 states and 54274 transitions. [2019-09-10 07:14:02,289 INFO L78 Accepts]: Start accepts. Automaton has 35450 states and 54274 transitions. Word has length 88 [2019-09-10 07:14:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:02,289 INFO L475 AbstractCegarLoop]: Abstraction has 35450 states and 54274 transitions. [2019-09-10 07:14:02,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:14:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 35450 states and 54274 transitions. [2019-09-10 07:14:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:02,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:02,298 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:14:02,298 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1462195186, now seen corresponding path program 1 times [2019-09-10 07:14:02,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:02,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:02,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:02,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:02,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:02,419 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:14:02,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:02,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:14:02,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:02,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:14:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:14:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:14:02,421 INFO L87 Difference]: Start difference. First operand 35450 states and 54274 transitions. Second operand 4 states. [2019-09-10 07:14:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:02,641 INFO L93 Difference]: Finished difference Result 64060 states and 97267 transitions. [2019-09-10 07:14:02,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:02,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 07:14:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:02,714 INFO L225 Difference]: With dead ends: 64060 [2019-09-10 07:14:02,714 INFO L226 Difference]: Without dead ends: 64060 [2019-09-10 07:14:02,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:14:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64060 states. [2019-09-10 07:14:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64060 to 63642. [2019-09-10 07:14:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63642 states. [2019-09-10 07:14:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63642 states to 63642 states and 96850 transitions. [2019-09-10 07:14:03,759 INFO L78 Accepts]: Start accepts. Automaton has 63642 states and 96850 transitions. Word has length 88 [2019-09-10 07:14:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:03,760 INFO L475 AbstractCegarLoop]: Abstraction has 63642 states and 96850 transitions. [2019-09-10 07:14:03,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:14:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 63642 states and 96850 transitions. [2019-09-10 07:14:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:03,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:03,768 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:14:03,768 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1996814445, now seen corresponding path program 1 times [2019-09-10 07:14:03,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:03,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:03,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:03,830 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:14:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:03,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:03,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:03,832 INFO L87 Difference]: Start difference. First operand 63642 states and 96850 transitions. Second operand 3 states. [2019-09-10 07:14:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:04,053 INFO L93 Difference]: Finished difference Result 70166 states and 105003 transitions. [2019-09-10 07:14:04,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:04,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:14:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:04,259 INFO L225 Difference]: With dead ends: 70166 [2019-09-10 07:14:04,260 INFO L226 Difference]: Without dead ends: 69694 [2019-09-10 07:14:04,263 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:14:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69694 states. [2019-09-10 07:14:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69694 to 62460. [2019-09-10 07:14:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62460 states. [2019-09-10 07:14:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62460 states to 62460 states and 93758 transitions. [2019-09-10 07:14:05,169 INFO L78 Accepts]: Start accepts. Automaton has 62460 states and 93758 transitions. Word has length 88 [2019-09-10 07:14:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:05,169 INFO L475 AbstractCegarLoop]: Abstraction has 62460 states and 93758 transitions. [2019-09-10 07:14:05,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 62460 states and 93758 transitions. [2019-09-10 07:14:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:05,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:05,180 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:14:05,180 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 154677300, now seen corresponding path program 1 times [2019-09-10 07:14:05,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:05,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:05,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:05,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:05,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:05,242 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:14:05,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:05,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:05,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:05,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:05,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:05,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:05,246 INFO L87 Difference]: Start difference. First operand 62460 states and 93758 transitions. Second operand 3 states. [2019-09-10 07:14:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:05,543 INFO L93 Difference]: Finished difference Result 86205 states and 128256 transitions. [2019-09-10 07:14:05,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:05,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:14:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:05,755 INFO L225 Difference]: With dead ends: 86205 [2019-09-10 07:14:05,755 INFO L226 Difference]: Without dead ends: 86205 [2019-09-10 07:14:05,756 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:14:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86205 states. [2019-09-10 07:14:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86205 to 61380. [2019-09-10 07:14:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61380 states. [2019-09-10 07:14:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61380 states to 61380 states and 91347 transitions. [2019-09-10 07:14:08,804 INFO L78 Accepts]: Start accepts. Automaton has 61380 states and 91347 transitions. Word has length 88 [2019-09-10 07:14:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:08,804 INFO L475 AbstractCegarLoop]: Abstraction has 61380 states and 91347 transitions. [2019-09-10 07:14:08,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 61380 states and 91347 transitions. [2019-09-10 07:14:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:08,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:08,814 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:14:08,814 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:08,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:08,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1046527154, now seen corresponding path program 1 times [2019-09-10 07:14:08,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:08,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:08,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:08,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:08,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:08,871 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:14:08,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:08,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:08,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:08,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:08,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:08,873 INFO L87 Difference]: Start difference. First operand 61380 states and 91347 transitions. Second operand 3 states. [2019-09-10 07:14:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:09,087 INFO L93 Difference]: Finished difference Result 69203 states and 101107 transitions. [2019-09-10 07:14:09,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:09,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:14:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:09,178 INFO L225 Difference]: With dead ends: 69203 [2019-09-10 07:14:09,178 INFO L226 Difference]: Without dead ends: 69203 [2019-09-10 07:14:09,179 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:14:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69203 states. [2019-09-10 07:14:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69203 to 68481. [2019-09-10 07:14:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68481 states. [2019-09-10 07:14:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68481 states to 68481 states and 100386 transitions. [2019-09-10 07:14:09,768 INFO L78 Accepts]: Start accepts. Automaton has 68481 states and 100386 transitions. Word has length 88 [2019-09-10 07:14:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:09,769 INFO L475 AbstractCegarLoop]: Abstraction has 68481 states and 100386 transitions. [2019-09-10 07:14:09,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 68481 states and 100386 transitions. [2019-09-10 07:14:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:09,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:09,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:09,776 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2055580396, now seen corresponding path program 1 times [2019-09-10 07:14:09,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:09,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:09,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:09,830 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:14:09,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:09,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:09,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:09,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:09,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:09,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:09,832 INFO L87 Difference]: Start difference. First operand 68481 states and 100386 transitions. Second operand 3 states. [2019-09-10 07:14:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:10,042 INFO L93 Difference]: Finished difference Result 81171 states and 116448 transitions. [2019-09-10 07:14:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:10,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:14:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:10,137 INFO L225 Difference]: With dead ends: 81171 [2019-09-10 07:14:10,138 INFO L226 Difference]: Without dead ends: 81171 [2019-09-10 07:14:10,138 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:14:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81171 states. [2019-09-10 07:14:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81171 to 80377. [2019-09-10 07:14:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80377 states. [2019-09-10 07:14:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80377 states to 80377 states and 115655 transitions. [2019-09-10 07:14:11,481 INFO L78 Accepts]: Start accepts. Automaton has 80377 states and 115655 transitions. Word has length 88 [2019-09-10 07:14:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:11,482 INFO L475 AbstractCegarLoop]: Abstraction has 80377 states and 115655 transitions. [2019-09-10 07:14:11,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 80377 states and 115655 transitions. [2019-09-10 07:14:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:11,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:11,491 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:14:11,491 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:11,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1270861016, now seen corresponding path program 1 times [2019-09-10 07:14:11,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:11,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:11,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:11,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:11,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:11,542 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:14:11,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:11,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:11,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:11,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:11,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:11,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:11,544 INFO L87 Difference]: Start difference. First operand 80377 states and 115655 transitions. Second operand 3 states. [2019-09-10 07:14:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:11,921 INFO L93 Difference]: Finished difference Result 107053 states and 151097 transitions. [2019-09-10 07:14:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:11,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:14:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:12,057 INFO L225 Difference]: With dead ends: 107053 [2019-09-10 07:14:12,057 INFO L226 Difference]: Without dead ends: 107053 [2019-09-10 07:14:12,058 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:14:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107053 states. [2019-09-10 07:14:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107053 to 106139. [2019-09-10 07:14:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106139 states. [2019-09-10 07:14:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106139 states to 106139 states and 150184 transitions. [2019-09-10 07:14:13,070 INFO L78 Accepts]: Start accepts. Automaton has 106139 states and 150184 transitions. Word has length 89 [2019-09-10 07:14:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:13,070 INFO L475 AbstractCegarLoop]: Abstraction has 106139 states and 150184 transitions. [2019-09-10 07:14:13,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 106139 states and 150184 transitions. [2019-09-10 07:14:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:13,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:13,075 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:14:13,075 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -202174862, now seen corresponding path program 1 times [2019-09-10 07:14:13,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:13,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:13,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:13,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:13,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:13,168 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:14:13,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:13,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:13,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:13,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:13,170 INFO L87 Difference]: Start difference. First operand 106139 states and 150184 transitions. Second operand 7 states. [2019-09-10 07:14:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:17,187 INFO L93 Difference]: Finished difference Result 437248 states and 611597 transitions. [2019-09-10 07:14:17,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:17,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:14:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:17,842 INFO L225 Difference]: With dead ends: 437248 [2019-09-10 07:14:17,842 INFO L226 Difference]: Without dead ends: 437248 [2019-09-10 07:14:17,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:14:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437248 states. [2019-09-10 07:14:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437248 to 106633. [2019-09-10 07:14:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106633 states. [2019-09-10 07:14:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106633 states to 106633 states and 150781 transitions. [2019-09-10 07:14:21,439 INFO L78 Accepts]: Start accepts. Automaton has 106633 states and 150781 transitions. Word has length 89 [2019-09-10 07:14:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:21,440 INFO L475 AbstractCegarLoop]: Abstraction has 106633 states and 150781 transitions. [2019-09-10 07:14:21,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 106633 states and 150781 transitions. [2019-09-10 07:14:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:21,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:21,445 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:14:21,445 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1465357821, now seen corresponding path program 1 times [2019-09-10 07:14:21,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:21,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:21,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:21,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:21,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:21,531 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:14:21,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:21,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:21,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:21,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:21,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:21,534 INFO L87 Difference]: Start difference. First operand 106633 states and 150781 transitions. Second operand 7 states. [2019-09-10 07:14:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:22,862 INFO L93 Difference]: Finished difference Result 329696 states and 461220 transitions. [2019-09-10 07:14:22,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:22,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:14:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:23,368 INFO L225 Difference]: With dead ends: 329696 [2019-09-10 07:14:23,368 INFO L226 Difference]: Without dead ends: 329696 [2019-09-10 07:14:23,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:14:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329696 states. [2019-09-10 07:14:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329696 to 133864. [2019-09-10 07:14:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133864 states. [2019-09-10 07:14:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133864 states to 133864 states and 188969 transitions. [2019-09-10 07:14:29,076 INFO L78 Accepts]: Start accepts. Automaton has 133864 states and 188969 transitions. Word has length 89 [2019-09-10 07:14:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:29,076 INFO L475 AbstractCegarLoop]: Abstraction has 133864 states and 188969 transitions. [2019-09-10 07:14:29,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 133864 states and 188969 transitions. [2019-09-10 07:14:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:29,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:29,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:29,082 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:29,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1453207386, now seen corresponding path program 1 times [2019-09-10 07:14:29,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:29,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:29,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:29,169 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:14:29,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:29,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:29,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:29,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:29,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:29,171 INFO L87 Difference]: Start difference. First operand 133864 states and 188969 transitions. Second operand 7 states. [2019-09-10 07:14:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:31,906 INFO L93 Difference]: Finished difference Result 547111 states and 765210 transitions. [2019-09-10 07:14:31,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:31,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:14:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:32,765 INFO L225 Difference]: With dead ends: 547111 [2019-09-10 07:14:32,766 INFO L226 Difference]: Without dead ends: 547111 [2019-09-10 07:14:32,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:14:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547111 states. [2019-09-10 07:14:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547111 to 134233. [2019-09-10 07:14:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134233 states. [2019-09-10 07:14:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134233 states to 134233 states and 189418 transitions. [2019-09-10 07:14:41,415 INFO L78 Accepts]: Start accepts. Automaton has 134233 states and 189418 transitions. Word has length 89 [2019-09-10 07:14:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:41,416 INFO L475 AbstractCegarLoop]: Abstraction has 134233 states and 189418 transitions. [2019-09-10 07:14:41,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 134233 states and 189418 transitions. [2019-09-10 07:14:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:41,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:41,423 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:14:41,424 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:41,424 INFO L82 PathProgramCache]: Analyzing trace with hash -604351932, now seen corresponding path program 1 times [2019-09-10 07:14:41,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:41,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:41,513 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:14:41,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:41,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:41,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:41,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:41,515 INFO L87 Difference]: Start difference. First operand 134233 states and 189418 transitions. Second operand 7 states. [2019-09-10 07:14:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:42,859 INFO L93 Difference]: Finished difference Result 345275 states and 485690 transitions. [2019-09-10 07:14:42,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:14:42,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:14:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:44,247 INFO L225 Difference]: With dead ends: 345275 [2019-09-10 07:14:44,247 INFO L226 Difference]: Without dead ends: 345275 [2019-09-10 07:14:44,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:14:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345275 states. [2019-09-10 07:14:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345275 to 134269. [2019-09-10 07:14:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134269 states. [2019-09-10 07:14:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134269 states to 134269 states and 189466 transitions. [2019-09-10 07:14:46,465 INFO L78 Accepts]: Start accepts. Automaton has 134269 states and 189466 transitions. Word has length 89 [2019-09-10 07:14:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:46,466 INFO L475 AbstractCegarLoop]: Abstraction has 134269 states and 189466 transitions. [2019-09-10 07:14:46,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 134269 states and 189466 transitions. [2019-09-10 07:14:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:14:46,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:46,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:46,473 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:46,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:46,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1413098648, now seen corresponding path program 1 times [2019-09-10 07:14:46,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:46,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:46,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:46,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:46,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:46,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:46,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:46,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:46,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:46,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:46,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:46,586 INFO L87 Difference]: Start difference. First operand 134269 states and 189466 transitions. Second operand 7 states. [2019-09-10 07:14:48,574 WARN L188 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 14 [2019-09-10 07:14:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:49,623 INFO L93 Difference]: Finished difference Result 406378 states and 569258 transitions. [2019-09-10 07:14:49,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:49,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:14:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:50,284 INFO L225 Difference]: With dead ends: 406378 [2019-09-10 07:14:50,284 INFO L226 Difference]: Without dead ends: 406378 [2019-09-10 07:14:50,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:14:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406378 states. [2019-09-10 07:14:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406378 to 134389. [2019-09-10 07:14:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134389 states. [2019-09-10 07:14:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134389 states to 134389 states and 189610 transitions. [2019-09-10 07:14:53,715 INFO L78 Accepts]: Start accepts. Automaton has 134389 states and 189610 transitions. Word has length 90 [2019-09-10 07:14:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:53,715 INFO L475 AbstractCegarLoop]: Abstraction has 134389 states and 189610 transitions. [2019-09-10 07:14:53,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 134389 states and 189610 transitions. [2019-09-10 07:14:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:14:53,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:53,722 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:53,723 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:53,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash -797974184, now seen corresponding path program 1 times [2019-09-10 07:14:53,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:53,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:53,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:53,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:53,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:53,845 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:14:53,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:53,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:53,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:53,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:53,847 INFO L87 Difference]: Start difference. First operand 134389 states and 189610 transitions. Second operand 7 states. [2019-09-10 07:14:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:55,250 INFO L93 Difference]: Finished difference Result 525159 states and 741962 transitions. [2019-09-10 07:14:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:14:55,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:14:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:56,010 INFO L225 Difference]: With dead ends: 525159 [2019-09-10 07:14:56,010 INFO L226 Difference]: Without dead ends: 525159 [2019-09-10 07:14:56,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:15:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525159 states. [2019-09-10 07:15:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525159 to 159277. [2019-09-10 07:15:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159277 states. [2019-09-10 07:15:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159277 states to 159277 states and 224548 transitions. [2019-09-10 07:15:04,082 INFO L78 Accepts]: Start accepts. Automaton has 159277 states and 224548 transitions. Word has length 91 [2019-09-10 07:15:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:04,082 INFO L475 AbstractCegarLoop]: Abstraction has 159277 states and 224548 transitions. [2019-09-10 07:15:04,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 159277 states and 224548 transitions. [2019-09-10 07:15:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:15:04,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:04,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:04,091 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1414412647, now seen corresponding path program 1 times [2019-09-10 07:15:04,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:04,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:04,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:04,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:04,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:04,254 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:15:04,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:04,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:15:04,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:04,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:15:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:15:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:04,257 INFO L87 Difference]: Start difference. First operand 159277 states and 224548 transitions. Second operand 7 states. [2019-09-10 07:15:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:06,860 INFO L93 Difference]: Finished difference Result 538815 states and 760848 transitions. [2019-09-10 07:15:06,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:15:06,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:15:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:07,735 INFO L225 Difference]: With dead ends: 538815 [2019-09-10 07:15:07,735 INFO L226 Difference]: Without dead ends: 538815 [2019-09-10 07:15:07,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:15:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538815 states. [2019-09-10 07:15:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538815 to 183533. [2019-09-10 07:15:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183533 states. [2019-09-10 07:15:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183533 states to 183533 states and 259161 transitions. [2019-09-10 07:15:17,978 INFO L78 Accepts]: Start accepts. Automaton has 183533 states and 259161 transitions. Word has length 91 [2019-09-10 07:15:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:17,978 INFO L475 AbstractCegarLoop]: Abstraction has 183533 states and 259161 transitions. [2019-09-10 07:15:17,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 183533 states and 259161 transitions. [2019-09-10 07:15:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:15:17,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:17,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:17,987 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:17,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1172360687, now seen corresponding path program 1 times [2019-09-10 07:15:17,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:17,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:17,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:17,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:17,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:18,112 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:15:18,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:18,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:15:18,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:18,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:15:18,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:15:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:18,113 INFO L87 Difference]: Start difference. First operand 183533 states and 259161 transitions. Second operand 7 states. [2019-09-10 07:15:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:19,512 INFO L93 Difference]: Finished difference Result 546867 states and 771978 transitions. [2019-09-10 07:15:19,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:15:19,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:15:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:20,325 INFO L225 Difference]: With dead ends: 546867 [2019-09-10 07:15:20,325 INFO L226 Difference]: Without dead ends: 546867 [2019-09-10 07:15:20,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546867 states. [2019-09-10 07:15:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546867 to 209886. [2019-09-10 07:15:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209886 states. [2019-09-10 07:15:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209886 states to 209886 states and 296679 transitions. [2019-09-10 07:15:29,615 INFO L78 Accepts]: Start accepts. Automaton has 209886 states and 296679 transitions. Word has length 91 [2019-09-10 07:15:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:29,616 INFO L475 AbstractCegarLoop]: Abstraction has 209886 states and 296679 transitions. [2019-09-10 07:15:29,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 209886 states and 296679 transitions. [2019-09-10 07:15:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:15:29,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:29,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:29,622 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash -184559459, now seen corresponding path program 1 times [2019-09-10 07:15:29,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:29,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:29,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:29,754 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:15:29,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:29,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:15:29,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:29,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:15:29,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:15:29,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:29,756 INFO L87 Difference]: Start difference. First operand 209886 states and 296679 transitions. Second operand 7 states. [2019-09-10 07:15:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:31,235 INFO L93 Difference]: Finished difference Result 557366 states and 787029 transitions. [2019-09-10 07:15:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:15:31,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:15:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:32,125 INFO L225 Difference]: With dead ends: 557366 [2019-09-10 07:15:32,125 INFO L226 Difference]: Without dead ends: 557366 [2019-09-10 07:15:32,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:15:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557366 states. [2019-09-10 07:15:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557366 to 248684. [2019-09-10 07:15:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248684 states. [2019-09-10 07:15:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248684 states to 248684 states and 351623 transitions. [2019-09-10 07:15:43,031 INFO L78 Accepts]: Start accepts. Automaton has 248684 states and 351623 transitions. Word has length 92 [2019-09-10 07:15:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:43,032 INFO L475 AbstractCegarLoop]: Abstraction has 248684 states and 351623 transitions. [2019-09-10 07:15:43,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 248684 states and 351623 transitions. [2019-09-10 07:15:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:15:43,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:43,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:43,038 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1345771757, now seen corresponding path program 1 times [2019-09-10 07:15:43,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:43,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:43,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:43,164 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:15:43,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:43,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:15:43,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:43,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:15:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:15:43,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:43,166 INFO L87 Difference]: Start difference. First operand 248684 states and 351623 transitions. Second operand 7 states. [2019-09-10 07:15:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:44,597 INFO L93 Difference]: Finished difference Result 590933 states and 834355 transitions. [2019-09-10 07:15:44,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:15:44,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:15:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:46,889 INFO L225 Difference]: With dead ends: 590933 [2019-09-10 07:15:46,889 INFO L226 Difference]: Without dead ends: 590933 [2019-09-10 07:15:46,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590933 states. [2019-09-10 07:15:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590933 to 283678. [2019-09-10 07:15:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283678 states. [2019-09-10 07:15:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283678 states to 283678 states and 401396 transitions. [2019-09-10 07:15:57,320 INFO L78 Accepts]: Start accepts. Automaton has 283678 states and 401396 transitions. Word has length 92 [2019-09-10 07:15:57,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:57,320 INFO L475 AbstractCegarLoop]: Abstraction has 283678 states and 401396 transitions. [2019-09-10 07:15:57,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 283678 states and 401396 transitions. [2019-09-10 07:15:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:15:57,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:57,331 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] [2019-09-10 07:15:57,331 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1282043687, now seen corresponding path program 1 times [2019-09-10 07:15:57,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:57,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:57,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:57,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:57,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:57,902 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-10 07:15:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:58,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:58,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:15:58,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:58,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:15:58,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:15:58,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:15:58,157 INFO L87 Difference]: Start difference. First operand 283678 states and 401396 transitions. Second operand 14 states. [2019-09-10 07:15:59,284 WARN L188 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-09-10 07:15:59,606 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:15:59,782 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:16:00,049 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 07:16:00,824 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 07:16:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:05,061 INFO L93 Difference]: Finished difference Result 1047259 states and 1473211 transitions. [2019-09-10 07:16:05,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:16:05,061 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-09-10 07:16:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:06,709 INFO L225 Difference]: With dead ends: 1047259 [2019-09-10 07:16:06,709 INFO L226 Difference]: Without dead ends: 1047259 [2019-09-10 07:16:06,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:16:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047259 states. [2019-09-10 07:16:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047259 to 533034. [2019-09-10 07:16:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533034 states. [2019-09-10 07:16:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533034 states to 533034 states and 753013 transitions. [2019-09-10 07:16:27,016 INFO L78 Accepts]: Start accepts. Automaton has 533034 states and 753013 transitions. Word has length 96 [2019-09-10 07:16:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:27,016 INFO L475 AbstractCegarLoop]: Abstraction has 533034 states and 753013 transitions. [2019-09-10 07:16:27,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:16:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 533034 states and 753013 transitions. [2019-09-10 07:16:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:16:27,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:27,028 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] [2019-09-10 07:16:27,028 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1382721840, now seen corresponding path program 1 times [2019-09-10 07:16:27,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:27,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:27,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:27,451 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:16:27,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:16:27,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:27,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:16:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:16:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:16:27,453 INFO L87 Difference]: Start difference. First operand 533034 states and 753013 transitions. Second operand 13 states. [2019-09-10 07:16:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:43,923 INFO L93 Difference]: Finished difference Result 2317752 states and 3259098 transitions. [2019-09-10 07:16:43,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:16:43,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-10 07:16:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:47,934 INFO L225 Difference]: With dead ends: 2317752 [2019-09-10 07:16:47,934 INFO L226 Difference]: Without dead ends: 2317752 [2019-09-10 07:16:47,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:17:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317752 states. [2019-09-10 07:17:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317752 to 532780. [2019-09-10 07:17:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532780 states. [2019-09-10 07:17:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532780 states to 532780 states and 752672 transitions. [2019-09-10 07:17:21,279 INFO L78 Accepts]: Start accepts. Automaton has 532780 states and 752672 transitions. Word has length 96 [2019-09-10 07:17:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:21,279 INFO L475 AbstractCegarLoop]: Abstraction has 532780 states and 752672 transitions. [2019-09-10 07:17:21,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:17:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 532780 states and 752672 transitions. [2019-09-10 07:17:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:17:21,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:21,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:21,291 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1343441496, now seen corresponding path program 1 times [2019-09-10 07:17:21,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:21,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:21,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:21,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:21,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:17:21,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:21,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:17:21,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:17:21,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:17:21,790 INFO L87 Difference]: Start difference. First operand 532780 states and 752672 transitions. Second operand 13 states. [2019-09-10 07:17:22,238 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 07:17:22,409 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:17:22,609 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:17:22,852 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 07:17:23,210 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 07:17:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:43,558 INFO L93 Difference]: Finished difference Result 2584338 states and 3650989 transitions. [2019-09-10 07:17:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:17:43,559 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 07:17:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:49,771 INFO L225 Difference]: With dead ends: 2584338 [2019-09-10 07:17:49,772 INFO L226 Difference]: Without dead ends: 2584338 [2019-09-10 07:17:49,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:17:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584338 states. [2019-09-10 07:18:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584338 to 532269. [2019-09-10 07:18:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532269 states. [2019-09-10 07:18:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532269 states to 532269 states and 752009 transitions. [2019-09-10 07:18:29,186 INFO L78 Accepts]: Start accepts. Automaton has 532269 states and 752009 transitions. Word has length 97 [2019-09-10 07:18:29,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:29,186 INFO L475 AbstractCegarLoop]: Abstraction has 532269 states and 752009 transitions. [2019-09-10 07:18:29,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:18:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 532269 states and 752009 transitions. [2019-09-10 07:18:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:18:29,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:29,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:29,195 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2096136003, now seen corresponding path program 1 times [2019-09-10 07:18:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:29,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:29,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:29,260 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:18:29,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:29,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:29,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:29,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:29,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:29,265 INFO L87 Difference]: Start difference. First operand 532269 states and 752009 transitions. Second operand 3 states. [2019-09-10 07:18:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:39,896 INFO L93 Difference]: Finished difference Result 835645 states and 1178288 transitions. [2019-09-10 07:18:39,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:39,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:18:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:41,429 INFO L225 Difference]: With dead ends: 835645 [2019-09-10 07:18:41,429 INFO L226 Difference]: Without dead ends: 835645 [2019-09-10 07:18:41,430 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:18:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835645 states. [2019-09-10 07:18:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835645 to 656393. [2019-09-10 07:18:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656393 states. [2019-09-10 07:18:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656393 states to 656393 states and 927695 transitions. [2019-09-10 07:18:52,923 INFO L78 Accepts]: Start accepts. Automaton has 656393 states and 927695 transitions. Word has length 97 [2019-09-10 07:18:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:52,924 INFO L475 AbstractCegarLoop]: Abstraction has 656393 states and 927695 transitions. [2019-09-10 07:18:52,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 656393 states and 927695 transitions. [2019-09-10 07:18:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:18:52,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:52,942 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] [2019-09-10 07:18:52,942 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1020605713, now seen corresponding path program 1 times [2019-09-10 07:18:52,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:52,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:52,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:52,996 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:18:52,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:52,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:52,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:52,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:52,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:52,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:52,998 INFO L87 Difference]: Start difference. First operand 656393 states and 927695 transitions. Second operand 3 states. [2019-09-10 07:19:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:05,446 INFO L93 Difference]: Finished difference Result 1043177 states and 1471797 transitions. [2019-09-10 07:19:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:05,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:19:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:07,510 INFO L225 Difference]: With dead ends: 1043177 [2019-09-10 07:19:07,511 INFO L226 Difference]: Without dead ends: 1043177 [2019-09-10 07:19:07,511 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:19:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043177 states. [2019-09-10 07:19:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043177 to 624538. [2019-09-10 07:19:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624538 states. [2019-09-10 07:19:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624538 states to 624538 states and 882612 transitions. [2019-09-10 07:19:20,586 INFO L78 Accepts]: Start accepts. Automaton has 624538 states and 882612 transitions. Word has length 101 [2019-09-10 07:19:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:20,586 INFO L475 AbstractCegarLoop]: Abstraction has 624538 states and 882612 transitions. [2019-09-10 07:19:20,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 624538 states and 882612 transitions. [2019-09-10 07:19:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:19:20,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:20,601 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] [2019-09-10 07:19:20,601 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690087, now seen corresponding path program 1 times [2019-09-10 07:19:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:20,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:20,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:21,324 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:19:21,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:21,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:19:21,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:21,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:19:21,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:19:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:19:21,326 INFO L87 Difference]: Start difference. First operand 624538 states and 882612 transitions. Second operand 19 states. [2019-09-10 07:19:28,138 WARN L188 SmtUtils]: Spent 6.31 s on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:19:28,430 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 07:19:28,673 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-09-10 07:19:28,862 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:19:29,459 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:19:29,973 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:19:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:34,786 INFO L93 Difference]: Finished difference Result 1192039 states and 1681540 transitions. [2019-09-10 07:19:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 07:19:34,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-09-10 07:19:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:38,349 INFO L225 Difference]: With dead ends: 1192039 [2019-09-10 07:19:38,349 INFO L226 Difference]: Without dead ends: 1192039 [2019-09-10 07:19:38,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:19:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192039 states. [2019-09-10 07:19:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192039 to 624588. [2019-09-10 07:19:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624588 states. [2019-09-10 07:19:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624588 states to 624588 states and 882692 transitions. [2019-09-10 07:19:58,819 INFO L78 Accepts]: Start accepts. Automaton has 624588 states and 882692 transitions. Word has length 101 [2019-09-10 07:19:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:58,820 INFO L475 AbstractCegarLoop]: Abstraction has 624588 states and 882692 transitions. [2019-09-10 07:19:58,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:19:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 624588 states and 882692 transitions. [2019-09-10 07:19:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:19:58,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:58,834 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:19:58,834 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1318468853, now seen corresponding path program 1 times [2019-09-10 07:19:58,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:58,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:58,875 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:19:58,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:58,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:58,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:58,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:58,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:58,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:58,876 INFO L87 Difference]: Start difference. First operand 624588 states and 882692 transitions. Second operand 3 states. [2019-09-10 07:20:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:03,275 INFO L93 Difference]: Finished difference Result 1000237 states and 1413362 transitions. [2019-09-10 07:20:03,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:20:03,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:20:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:05,170 INFO L225 Difference]: With dead ends: 1000237 [2019-09-10 07:20:05,171 INFO L226 Difference]: Without dead ends: 1000237 [2019-09-10 07:20:05,171 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:20:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000237 states. [2019-09-10 07:20:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000237 to 997088. [2019-09-10 07:20:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997088 states. [2019-09-10 07:20:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997088 states to 997088 states and 1410214 transitions. [2019-09-10 07:20:31,375 INFO L78 Accepts]: Start accepts. Automaton has 997088 states and 1410214 transitions. Word has length 102 [2019-09-10 07:20:31,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:31,376 INFO L475 AbstractCegarLoop]: Abstraction has 997088 states and 1410214 transitions. [2019-09-10 07:20:31,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:20:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 997088 states and 1410214 transitions. [2019-09-10 07:20:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:20:31,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:31,393 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:20:31,393 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:31,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1371769540, now seen corresponding path program 1 times [2019-09-10 07:20:31,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:31,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:31,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:31,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:32,052 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:20:32,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:32,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:20:32,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:32,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:20:32,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:20:32,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:20:32,054 INFO L87 Difference]: Start difference. First operand 997088 states and 1410214 transitions. Second operand 13 states. [2019-09-10 07:20:41,441 WARN L188 SmtUtils]: Spent 9.12 s on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:20:41,602 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:20:41,758 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:20:41,921 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:20:42,129 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 07:20:42,278 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:20:42,487 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:20:42,845 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:21:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:13,386 INFO L93 Difference]: Finished difference Result 4205148 states and 5956135 transitions. [2019-09-10 07:21:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:21:13,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2019-09-10 07:21:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:23,481 INFO L225 Difference]: With dead ends: 4205148 [2019-09-10 07:21:23,481 INFO L226 Difference]: Without dead ends: 4205148 [2019-09-10 07:21:23,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:21:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4205148 states. [2019-09-10 07:22:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4205148 to 968270. [2019-09-10 07:22:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968270 states.