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/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:01:03,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:01:03,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:01:03,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:01:03,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:01:03,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:01:03,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:01:03,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:01:03,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:01:03,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:01:03,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:01:03,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:01:03,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:01:03,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:01:03,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:01:03,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:01:03,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:01:03,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:01:03,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:01:03,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:01:03,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:01:03,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:01:03,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:01:03,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:01:03,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:01:03,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:01:03,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:01:03,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:01:03,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:01:03,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:01:03,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:01:03,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:01:03,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:01:03,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:01:03,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:01:03,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:01:03,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:01:03,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:01:03,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:01:03,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:01:03,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:01:03,941 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 04:01:03,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:01:03,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:01:03,956 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:01:03,956 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:01:03,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:01:03,957 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:01:03,957 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:01:03,957 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:01:03,958 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:01:03,958 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:01:03,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:01:03,959 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:01:03,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:01:03,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:01:03,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:01:03,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:01:03,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:01:03,960 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:01:03,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:01:03,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:01:03,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:01:03,960 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:01:03,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:01:03,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:01:03,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:01:03,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:01:03,961 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:01:03,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:01:03,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:01:03,962 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:01:03,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:01:04,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:01:04,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:01:04,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:01:04,007 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:01:04,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:04,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad573f02e/ce2eacc3f8744de784ba14fe22d250c1/FLAGb50557a59 [2019-09-10 04:01:04,587 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:01:04,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:04,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad573f02e/ce2eacc3f8744de784ba14fe22d250c1/FLAGb50557a59 [2019-09-10 04:01:04,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad573f02e/ce2eacc3f8744de784ba14fe22d250c1 [2019-09-10 04:01:04,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:01:04,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:01:04,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:01:04,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:01:04,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:01:04,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:01:04" (1/1) ... [2019-09-10 04:01:04,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fa844d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:04, skipping insertion in model container [2019-09-10 04:01:04,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:01:04" (1/1) ... [2019-09-10 04:01:04,913 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:01:04,982 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:01:05,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:01:05,450 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:01:05,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:01:05,607 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:01:05,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05 WrapperNode [2019-09-10 04:01:05,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:01:05,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:01:05,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:01:05,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:01:05,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (1/1) ... [2019-09-10 04:01:05,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (1/1) ... [2019-09-10 04:01:05,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (1/1) ... [2019-09-10 04:01:05,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (1/1) ... [2019-09-10 04:01:05,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (1/1) ... [2019-09-10 04:01:05,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (1/1) ... [2019-09-10 04:01:05,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (1/1) ... [2019-09-10 04:01:05,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:01:05,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:01:05,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:01:05,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:01:05,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:01:05,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:01:05,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:01:05,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:01:05,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:01:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:01:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:01:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:01:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:01:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:01:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:01:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:01:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:01:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:01:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:01:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:01:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:01:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:01:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:01:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:01:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:01:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:01:07,125 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:01:07,126 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:01:07,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:01:07 BoogieIcfgContainer [2019-09-10 04:01:07,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:01:07,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:01:07,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:01:07,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:01:07,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:01:04" (1/3) ... [2019-09-10 04:01:07,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c08db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:01:07, skipping insertion in model container [2019-09-10 04:01:07,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:05" (2/3) ... [2019-09-10 04:01:07,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c08db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:01:07, skipping insertion in model container [2019-09-10 04:01:07,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:01:07" (3/3) ... [2019-09-10 04:01:07,138 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:07,148 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:01:07,158 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:01:07,175 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:01:07,207 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:01:07,208 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:01:07,208 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:01:07,208 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:01:07,208 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:01:07,208 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:01:07,209 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:01:07,209 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:01:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-09-10 04:01:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:01:07,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:07,269 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] [2019-09-10 04:01:07,271 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1109206420, now seen corresponding path program 1 times [2019-09-10 04:01:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:07,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:07,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:07,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:07,843 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 04:01:07,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:07,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:01:07,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:07,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:01:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:01:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:01:07,869 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 5 states. [2019-09-10 04:01:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:08,033 INFO L93 Difference]: Finished difference Result 334 states and 576 transitions. [2019-09-10 04:01:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:01:08,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 04:01:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:08,063 INFO L225 Difference]: With dead ends: 334 [2019-09-10 04:01:08,063 INFO L226 Difference]: Without dead ends: 330 [2019-09-10 04:01:08,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-10 04:01:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2019-09-10 04:01:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 04:01:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 531 transitions. [2019-09-10 04:01:08,135 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 531 transitions. Word has length 98 [2019-09-10 04:01:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:08,135 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 531 transitions. [2019-09-10 04:01:08,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 531 transitions. [2019-09-10 04:01:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 04:01:08,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:08,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:08,143 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1532145528, now seen corresponding path program 1 times [2019-09-10 04:01:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:08,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:08,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:08,647 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 04:01:08,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:08,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:01:08,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:08,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:01:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:01:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:08,651 INFO L87 Difference]: Start difference. First operand 330 states and 531 transitions. Second operand 11 states. [2019-09-10 04:01:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:15,209 INFO L93 Difference]: Finished difference Result 1185 states and 1990 transitions. [2019-09-10 04:01:15,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 04:01:15,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-09-10 04:01:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:15,224 INFO L225 Difference]: With dead ends: 1185 [2019-09-10 04:01:15,224 INFO L226 Difference]: Without dead ends: 1185 [2019-09-10 04:01:15,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 04:01:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-09-10 04:01:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 865. [2019-09-10 04:01:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-10 04:01:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1401 transitions. [2019-09-10 04:01:15,340 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1401 transitions. Word has length 139 [2019-09-10 04:01:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:15,341 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1401 transitions. [2019-09-10 04:01:15,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:01:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1401 transitions. [2019-09-10 04:01:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 04:01:15,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:15,359 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:15,359 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:15,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1009788152, now seen corresponding path program 1 times [2019-09-10 04:01:15,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:15,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:15,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:15,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:15,598 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 04:01:15,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:15,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:01:15,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:15,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:01:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:01:15,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:15,601 INFO L87 Difference]: Start difference. First operand 865 states and 1401 transitions. Second operand 6 states. [2019-09-10 04:01:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:17,940 INFO L93 Difference]: Finished difference Result 2027 states and 3263 transitions. [2019-09-10 04:01:17,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:01:17,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 04:01:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:17,959 INFO L225 Difference]: With dead ends: 2027 [2019-09-10 04:01:17,959 INFO L226 Difference]: Without dead ends: 2027 [2019-09-10 04:01:17,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:01:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-09-10 04:01:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2014. [2019-09-10 04:01:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-09-10 04:01:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 3249 transitions. [2019-09-10 04:01:18,051 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 3249 transitions. Word has length 140 [2019-09-10 04:01:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:18,052 INFO L475 AbstractCegarLoop]: Abstraction has 2014 states and 3249 transitions. [2019-09-10 04:01:18,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:01:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 3249 transitions. [2019-09-10 04:01:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 04:01:18,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:18,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:18,057 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1742961455, now seen corresponding path program 1 times [2019-09-10 04:01:18,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:18,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:18,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:18,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:18,339 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 04:01:18,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:18,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:01:18,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:18,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:01:18,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:01:18,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:18,343 INFO L87 Difference]: Start difference. First operand 2014 states and 3249 transitions. Second operand 6 states. [2019-09-10 04:01:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:20,253 INFO L93 Difference]: Finished difference Result 5755 states and 9250 transitions. [2019-09-10 04:01:20,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:01:20,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 04:01:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:20,286 INFO L225 Difference]: With dead ends: 5755 [2019-09-10 04:01:20,287 INFO L226 Difference]: Without dead ends: 5755 [2019-09-10 04:01:20,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2019-09-10 04:01:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5066. [2019-09-10 04:01:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5066 states. [2019-09-10 04:01:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5066 states to 5066 states and 8139 transitions. [2019-09-10 04:01:20,481 INFO L78 Accepts]: Start accepts. Automaton has 5066 states and 8139 transitions. Word has length 141 [2019-09-10 04:01:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:20,481 INFO L475 AbstractCegarLoop]: Abstraction has 5066 states and 8139 transitions. [2019-09-10 04:01:20,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:01:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 8139 transitions. [2019-09-10 04:01:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 04:01:20,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:20,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:20,488 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1127168415, now seen corresponding path program 1 times [2019-09-10 04:01:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:20,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:20,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:20,692 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 04:01:20,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:20,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:01:20,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:20,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:01:20,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:01:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:20,695 INFO L87 Difference]: Start difference. First operand 5066 states and 8139 transitions. Second operand 6 states. [2019-09-10 04:01:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:22,235 INFO L93 Difference]: Finished difference Result 10382 states and 16575 transitions. [2019-09-10 04:01:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:01:22,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 04:01:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:22,289 INFO L225 Difference]: With dead ends: 10382 [2019-09-10 04:01:22,289 INFO L226 Difference]: Without dead ends: 10382 [2019-09-10 04:01:22,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:01:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2019-09-10 04:01:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 10342. [2019-09-10 04:01:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10342 states. [2019-09-10 04:01:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10342 states to 10342 states and 16534 transitions. [2019-09-10 04:01:22,554 INFO L78 Accepts]: Start accepts. Automaton has 10342 states and 16534 transitions. Word has length 142 [2019-09-10 04:01:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:22,554 INFO L475 AbstractCegarLoop]: Abstraction has 10342 states and 16534 transitions. [2019-09-10 04:01:22,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:01:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 10342 states and 16534 transitions. [2019-09-10 04:01:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 04:01:22,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:22,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:22,562 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:22,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:22,562 INFO L82 PathProgramCache]: Analyzing trace with hash -834231578, now seen corresponding path program 1 times [2019-09-10 04:01:22,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:22,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:22,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:22,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:22,794 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 04:01:22,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:22,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:01:22,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:22,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:01:22,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:01:22,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:22,797 INFO L87 Difference]: Start difference. First operand 10342 states and 16534 transitions. Second operand 6 states. [2019-09-10 04:01:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:24,781 INFO L93 Difference]: Finished difference Result 39433 states and 63010 transitions. [2019-09-10 04:01:24,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:01:24,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 04:01:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:25,019 INFO L225 Difference]: With dead ends: 39433 [2019-09-10 04:01:25,019 INFO L226 Difference]: Without dead ends: 39433 [2019-09-10 04:01:25,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39433 states. [2019-09-10 04:01:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39433 to 31316. [2019-09-10 04:01:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31316 states. [2019-09-10 04:01:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31316 states to 31316 states and 49962 transitions. [2019-09-10 04:01:26,287 INFO L78 Accepts]: Start accepts. Automaton has 31316 states and 49962 transitions. Word has length 143 [2019-09-10 04:01:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:26,288 INFO L475 AbstractCegarLoop]: Abstraction has 31316 states and 49962 transitions. [2019-09-10 04:01:26,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:01:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 31316 states and 49962 transitions. [2019-09-10 04:01:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:01:26,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:26,297 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:26,297 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash 311829015, now seen corresponding path program 1 times [2019-09-10 04:01:26,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:26,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:26,651 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 04:01:26,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:26,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:01:26,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:26,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:01:26,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:01:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:26,655 INFO L87 Difference]: Start difference. First operand 31316 states and 49962 transitions. Second operand 11 states. [2019-09-10 04:01:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:35,750 INFO L93 Difference]: Finished difference Result 37176 states and 59154 transitions. [2019-09-10 04:01:35,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 04:01:35,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 04:01:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:35,858 INFO L225 Difference]: With dead ends: 37176 [2019-09-10 04:01:35,859 INFO L226 Difference]: Without dead ends: 37176 [2019-09-10 04:01:35,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:01:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37176 states. [2019-09-10 04:01:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37176 to 36784. [2019-09-10 04:01:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36784 states. [2019-09-10 04:01:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36784 states to 36784 states and 58754 transitions. [2019-09-10 04:01:36,488 INFO L78 Accepts]: Start accepts. Automaton has 36784 states and 58754 transitions. Word has length 145 [2019-09-10 04:01:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:36,488 INFO L475 AbstractCegarLoop]: Abstraction has 36784 states and 58754 transitions. [2019-09-10 04:01:36,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:01:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 36784 states and 58754 transitions. [2019-09-10 04:01:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:01:36,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:36,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:36,498 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1376899337, now seen corresponding path program 1 times [2019-09-10 04:01:36,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:36,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:36,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:36,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:36,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:36,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:01:36,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:36,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:01:36,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:01:36,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:36,883 INFO L87 Difference]: Start difference. First operand 36784 states and 58754 transitions. Second operand 11 states. [2019-09-10 04:01:39,920 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-09-10 04:01:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:43,669 INFO L93 Difference]: Finished difference Result 43748 states and 69893 transitions. [2019-09-10 04:01:43,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 04:01:43,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 04:01:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:43,757 INFO L225 Difference]: With dead ends: 43748 [2019-09-10 04:01:43,758 INFO L226 Difference]: Without dead ends: 43748 [2019-09-10 04:01:43,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=599, Invalid=2371, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:01:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43748 states. [2019-09-10 04:01:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43748 to 43545. [2019-09-10 04:01:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43545 states. [2019-09-10 04:01:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43545 states to 43545 states and 69694 transitions. [2019-09-10 04:01:44,403 INFO L78 Accepts]: Start accepts. Automaton has 43545 states and 69694 transitions. Word has length 145 [2019-09-10 04:01:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:44,403 INFO L475 AbstractCegarLoop]: Abstraction has 43545 states and 69694 transitions. [2019-09-10 04:01:44,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:01:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 43545 states and 69694 transitions. [2019-09-10 04:01:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:01:44,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:44,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:44,409 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:44,410 INFO L82 PathProgramCache]: Analyzing trace with hash 146101726, now seen corresponding path program 1 times [2019-09-10 04:01:44,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:44,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:44,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:44,509 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 04:01:44,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:44,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:01:44,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:44,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:01:44,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:01:44,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:01:44,511 INFO L87 Difference]: Start difference. First operand 43545 states and 69694 transitions. Second operand 4 states. [2019-09-10 04:01:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:46,143 INFO L93 Difference]: Finished difference Result 115099 states and 182970 transitions. [2019-09-10 04:01:46,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:01:46,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-10 04:01:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:46,448 INFO L225 Difference]: With dead ends: 115099 [2019-09-10 04:01:46,448 INFO L226 Difference]: Without dead ends: 115099 [2019-09-10 04:01:46,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:01:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115099 states. [2019-09-10 04:01:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115099 to 114106. [2019-09-10 04:01:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114106 states. [2019-09-10 04:01:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114106 states to 114106 states and 181652 transitions. [2019-09-10 04:01:48,332 INFO L78 Accepts]: Start accepts. Automaton has 114106 states and 181652 transitions. Word has length 145 [2019-09-10 04:01:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:48,333 INFO L475 AbstractCegarLoop]: Abstraction has 114106 states and 181652 transitions. [2019-09-10 04:01:48,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:01:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 114106 states and 181652 transitions. [2019-09-10 04:01:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:01:48,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:48,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:48,339 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash -453405869, now seen corresponding path program 1 times [2019-09-10 04:01:48,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:48,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:48,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:48,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:01:48,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:48,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:01:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:01:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:48,608 INFO L87 Difference]: Start difference. First operand 114106 states and 181652 transitions. Second operand 11 states. [2019-09-10 04:01:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:57,547 INFO L93 Difference]: Finished difference Result 138930 states and 222242 transitions. [2019-09-10 04:01:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 04:01:57,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 04:01:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:57,996 INFO L225 Difference]: With dead ends: 138930 [2019-09-10 04:01:57,996 INFO L226 Difference]: Without dead ends: 138930 [2019-09-10 04:01:57,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 04:01:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138930 states. [2019-09-10 04:01:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138930 to 138001. [2019-09-10 04:01:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138001 states. [2019-09-10 04:01:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138001 states to 138001 states and 220072 transitions. [2019-09-10 04:01:59,894 INFO L78 Accepts]: Start accepts. Automaton has 138001 states and 220072 transitions. Word has length 145 [2019-09-10 04:01:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:59,894 INFO L475 AbstractCegarLoop]: Abstraction has 138001 states and 220072 transitions. [2019-09-10 04:01:59,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:01:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 138001 states and 220072 transitions. [2019-09-10 04:01:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:01:59,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:59,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:59,902 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1588333813, now seen corresponding path program 1 times [2019-09-10 04:01:59,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:59,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:59,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:02,383 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 04:02:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:02,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:02:02,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:02,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:02:02,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:02:02,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:02:02,385 INFO L87 Difference]: Start difference. First operand 138001 states and 220072 transitions. Second operand 7 states. [2019-09-10 04:02:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:04,766 INFO L93 Difference]: Finished difference Result 156128 states and 250103 transitions. [2019-09-10 04:02:04,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:02:04,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 04:02:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:05,243 INFO L225 Difference]: With dead ends: 156128 [2019-09-10 04:02:05,243 INFO L226 Difference]: Without dead ends: 156128 [2019-09-10 04:02:05,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:02:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156128 states. [2019-09-10 04:02:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156128 to 96748. [2019-09-10 04:02:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96748 states. [2019-09-10 04:02:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96748 states to 96748 states and 154389 transitions. [2019-09-10 04:02:07,121 INFO L78 Accepts]: Start accepts. Automaton has 96748 states and 154389 transitions. Word has length 146 [2019-09-10 04:02:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:07,122 INFO L475 AbstractCegarLoop]: Abstraction has 96748 states and 154389 transitions. [2019-09-10 04:02:07,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:02:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 96748 states and 154389 transitions. [2019-09-10 04:02:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:02:07,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:07,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:07,128 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1862627981, now seen corresponding path program 1 times [2019-09-10 04:02:07,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:07,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:07,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:07,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:07,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:07,389 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 04:02:07,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:07,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 04:02:07,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:07,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:02:07,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:02:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:02:07,391 INFO L87 Difference]: Start difference. First operand 96748 states and 154389 transitions. Second operand 12 states. [2019-09-10 04:02:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:13,734 INFO L93 Difference]: Finished difference Result 108927 states and 173958 transitions. [2019-09-10 04:02:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 04:02:13,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-10 04:02:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:14,103 INFO L225 Difference]: With dead ends: 108927 [2019-09-10 04:02:14,103 INFO L226 Difference]: Without dead ends: 108927 [2019-09-10 04:02:14,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 04:02:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108927 states. [2019-09-10 04:02:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108927 to 108748. [2019-09-10 04:02:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108748 states. [2019-09-10 04:02:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108748 states to 108748 states and 173573 transitions. [2019-09-10 04:02:15,994 INFO L78 Accepts]: Start accepts. Automaton has 108748 states and 173573 transitions. Word has length 146 [2019-09-10 04:02:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:15,994 INFO L475 AbstractCegarLoop]: Abstraction has 108748 states and 173573 transitions. [2019-09-10 04:02:15,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 04:02:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 108748 states and 173573 transitions. [2019-09-10 04:02:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:02:16,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:16,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:16,001 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1985707213, now seen corresponding path program 1 times [2019-09-10 04:02:16,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:16,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:16,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:16,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:16,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:16,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:16,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:02:16,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:16,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:02:16,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:02:16,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:02:16,226 INFO L87 Difference]: Start difference. First operand 108748 states and 173573 transitions. Second operand 5 states. [2019-09-10 04:02:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:17,708 INFO L93 Difference]: Finished difference Result 215876 states and 341655 transitions. [2019-09-10 04:02:17,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:17,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-10 04:02:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:18,238 INFO L225 Difference]: With dead ends: 215876 [2019-09-10 04:02:18,238 INFO L226 Difference]: Without dead ends: 215876 [2019-09-10 04:02:18,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:02:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215876 states. [2019-09-10 04:02:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215876 to 215874. [2019-09-10 04:02:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215874 states. [2019-09-10 04:02:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215874 states to 215874 states and 341654 transitions. [2019-09-10 04:02:23,456 INFO L78 Accepts]: Start accepts. Automaton has 215874 states and 341654 transitions. Word has length 148 [2019-09-10 04:02:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:23,456 INFO L475 AbstractCegarLoop]: Abstraction has 215874 states and 341654 transitions. [2019-09-10 04:02:23,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:02:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 215874 states and 341654 transitions. [2019-09-10 04:02:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:02:23,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:23,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:23,468 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1735540910, now seen corresponding path program 1 times [2019-09-10 04:02:23,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:23,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:23,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:23,649 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 04:02:23,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:23,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:02:23,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:23,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:02:23,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:02:23,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:02:23,651 INFO L87 Difference]: Start difference. First operand 215874 states and 341654 transitions. Second operand 5 states. [2019-09-10 04:02:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:26,530 INFO L93 Difference]: Finished difference Result 294425 states and 459798 transitions. [2019-09-10 04:02:26,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:26,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 04:02:26,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:27,257 INFO L225 Difference]: With dead ends: 294425 [2019-09-10 04:02:27,257 INFO L226 Difference]: Without dead ends: 294425 [2019-09-10 04:02:27,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:02:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294425 states. [2019-09-10 04:02:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294425 to 276021. [2019-09-10 04:02:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276021 states. [2019-09-10 04:02:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276021 states to 276021 states and 438605 transitions. [2019-09-10 04:02:36,088 INFO L78 Accepts]: Start accepts. Automaton has 276021 states and 438605 transitions. Word has length 150 [2019-09-10 04:02:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:36,088 INFO L475 AbstractCegarLoop]: Abstraction has 276021 states and 438605 transitions. [2019-09-10 04:02:36,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:02:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 276021 states and 438605 transitions. [2019-09-10 04:02:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:36,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:36,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:36,100 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:36,101 INFO L82 PathProgramCache]: Analyzing trace with hash 704760191, now seen corresponding path program 1 times [2019-09-10 04:02:36,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:36,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:36,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:36,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:36,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:36,278 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 04:02:36,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:36,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 04:02:36,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:36,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 04:02:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 04:02:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:02:36,280 INFO L87 Difference]: Start difference. First operand 276021 states and 438605 transitions. Second operand 10 states. [2019-09-10 04:02:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:40,558 INFO L93 Difference]: Finished difference Result 371761 states and 598993 transitions. [2019-09-10 04:02:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:02:40,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-10 04:02:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:41,654 INFO L225 Difference]: With dead ends: 371761 [2019-09-10 04:02:41,654 INFO L226 Difference]: Without dead ends: 371761 [2019-09-10 04:02:41,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:02:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371761 states. [2019-09-10 04:02:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371761 to 279029. [2019-09-10 04:02:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279029 states. [2019-09-10 04:02:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279029 states to 279029 states and 443292 transitions. [2019-09-10 04:02:51,696 INFO L78 Accepts]: Start accepts. Automaton has 279029 states and 443292 transitions. Word has length 152 [2019-09-10 04:02:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:51,697 INFO L475 AbstractCegarLoop]: Abstraction has 279029 states and 443292 transitions. [2019-09-10 04:02:51,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 04:02:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 279029 states and 443292 transitions. [2019-09-10 04:02:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:51,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:51,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:51,709 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:51,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 979519805, now seen corresponding path program 1 times [2019-09-10 04:02:51,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:51,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:51,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:51,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:51,859 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 04:02:51,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:51,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:02:51,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:51,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:02:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:02:51,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:02:51,861 INFO L87 Difference]: Start difference. First operand 279029 states and 443292 transitions. Second operand 5 states. [2019-09-10 04:02:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:55,805 INFO L93 Difference]: Finished difference Result 449915 states and 709420 transitions. [2019-09-10 04:02:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:55,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-09-10 04:02:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:56,990 INFO L225 Difference]: With dead ends: 449915 [2019-09-10 04:02:56,991 INFO L226 Difference]: Without dead ends: 449915 [2019-09-10 04:02:56,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:02:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449915 states. [2019-09-10 04:03:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449915 to 449725. [2019-09-10 04:03:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449725 states. [2019-09-10 04:03:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449725 states to 449725 states and 709031 transitions. [2019-09-10 04:03:09,272 INFO L78 Accepts]: Start accepts. Automaton has 449725 states and 709031 transitions. Word has length 152 [2019-09-10 04:03:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:09,272 INFO L475 AbstractCegarLoop]: Abstraction has 449725 states and 709031 transitions. [2019-09-10 04:03:09,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:03:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 449725 states and 709031 transitions. [2019-09-10 04:03:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:03:09,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:09,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:03:09,277 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1874141699, now seen corresponding path program 1 times [2019-09-10 04:03:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:09,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:09,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:09,528 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 04:03:09,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:09,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:03:09,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:09,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:03:09,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:03:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:03:09,530 INFO L87 Difference]: Start difference. First operand 449725 states and 709031 transitions. Second operand 5 states. [2019-09-10 04:03:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:20,250 INFO L93 Difference]: Finished difference Result 892266 states and 1393655 transitions. [2019-09-10 04:03:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:03:20,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 04:03:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:22,504 INFO L225 Difference]: With dead ends: 892266 [2019-09-10 04:03:22,504 INFO L226 Difference]: Without dead ends: 892266 [2019-09-10 04:03:22,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:03:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892266 states. [2019-09-10 04:03:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892266 to 892264. [2019-09-10 04:03:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892264 states. [2019-09-10 04:03:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892264 states to 892264 states and 1393654 transitions. [2019-09-10 04:03:55,898 INFO L78 Accepts]: Start accepts. Automaton has 892264 states and 1393654 transitions. Word has length 153 [2019-09-10 04:03:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:55,899 INFO L475 AbstractCegarLoop]: Abstraction has 892264 states and 1393654 transitions. [2019-09-10 04:03:55,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:03:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 892264 states and 1393654 transitions. [2019-09-10 04:03:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:03:55,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:55,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:03:55,908 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1792688217, now seen corresponding path program 1 times [2019-09-10 04:03:55,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:55,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:55,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:56,095 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 04:03:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:56,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:03:56,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:56,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:03:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:03:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:03:56,097 INFO L87 Difference]: Start difference. First operand 892264 states and 1393654 transitions. Second operand 5 states. [2019-09-10 04:04:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:14,859 INFO L93 Difference]: Finished difference Result 1772092 states and 2751951 transitions. [2019-09-10 04:04:14,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:04:14,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 04:04:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:34,704 INFO L225 Difference]: With dead ends: 1772092 [2019-09-10 04:04:34,704 INFO L226 Difference]: Without dead ends: 1772092 [2019-09-10 04:04:34,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:04:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772092 states.