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.3.3.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:55:22,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:55:22,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:55:22,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:55:22,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:55:22,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:55:22,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:55:22,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:55:22,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:55:22,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:55:22,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:55:22,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:55:22,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:55:22,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:55:22,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:55:22,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:55:22,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:55:22,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:55:22,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:55:22,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:55:22,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:55:22,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:55:22,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:55:22,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:55:22,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:55:22,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:55:22,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:55:22,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:55:22,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:55:22,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:55:22,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:55:22,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:55:22,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:55:22,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:55:22,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:55:22,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:55:22,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:55:22,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:55:22,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:55:22,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:55:22,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:55:22,895 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 03:55:22,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:55:22,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:55:22,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:55:22,917 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:55:22,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:55:22,918 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:55:22,919 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:55:22,919 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:55:22,919 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:55:22,919 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:55:22,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:55:22,920 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:55:22,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:55:22,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:55:22,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:55:22,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:55:22,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:55:22,921 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:55:22,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:55:22,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:55:22,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:55:22,924 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:55:22,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:55:22,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:55:22,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:55:22,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:55:22,925 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:55:22,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:55:22,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:55:22,926 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:55:22,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:55:22,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:55:22,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:55:23,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:55:23,001 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:55:23,002 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-10 03:55:23,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b3b8968/925017a809134908a65e0294337aa385/FLAG1bbecee4c [2019-09-10 03:55:23,650 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:55:23,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-10 03:55:23,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b3b8968/925017a809134908a65e0294337aa385/FLAG1bbecee4c [2019-09-10 03:55:23,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b3b8968/925017a809134908a65e0294337aa385 [2019-09-10 03:55:23,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:55:23,965 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:55:23,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:55:23,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:55:23,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:55:23,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:55:23" (1/1) ... [2019-09-10 03:55:23,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55420a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:23, skipping insertion in model container [2019-09-10 03:55:23,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:55:23" (1/1) ... [2019-09-10 03:55:23,982 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:55:24,031 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:55:24,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:55:24,410 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:55:24,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:55:24,538 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:55:24,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24 WrapperNode [2019-09-10 03:55:24,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:55:24,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:55:24,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:55:24,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:55:24,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (1/1) ... [2019-09-10 03:55:24,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (1/1) ... [2019-09-10 03:55:24,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (1/1) ... [2019-09-10 03:55:24,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (1/1) ... [2019-09-10 03:55:24,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (1/1) ... [2019-09-10 03:55:24,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (1/1) ... [2019-09-10 03:55:24,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (1/1) ... [2019-09-10 03:55:24,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:55:24,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:55:24,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:55:24,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:55:24,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (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 03:55:24,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:55:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:55:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 03:55:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 03:55:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 03:55:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 03:55:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 03:55:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:55:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 03:55:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:55:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 03:55:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 03:55:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 03:55:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 03:55:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 03:55:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 03:55:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 03:55:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 03:55:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 03:55:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 03:55:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 03:55:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 03:55:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:55:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:55:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:55:25,523 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:55:25,523 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 03:55:25,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:55:25 BoogieIcfgContainer [2019-09-10 03:55:25,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:55:25,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:55:25,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:55:25,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:55:25,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:55:23" (1/3) ... [2019-09-10 03:55:25,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c698181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:55:25, skipping insertion in model container [2019-09-10 03:55:25,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:24" (2/3) ... [2019-09-10 03:55:25,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c698181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:55:25, skipping insertion in model container [2019-09-10 03:55:25,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:55:25" (3/3) ... [2019-09-10 03:55:25,532 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-10 03:55:25,541 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:55:25,550 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:55:25,567 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:55:25,593 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:55:25,594 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:55:25,594 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:55:25,594 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:55:25,594 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:55:25,594 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:55:25,594 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:55:25,594 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:55:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-09-10 03:55:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 03:55:25,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:25,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:25,633 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:25,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash 599968013, now seen corresponding path program 1 times [2019-09-10 03:55:25,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:25,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:25,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:25,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:25,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:26,149 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 03:55:26,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:26,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:26,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:26,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:26,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:26,185 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 5 states. [2019-09-10 03:55:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:26,355 INFO L93 Difference]: Finished difference Result 157 states and 252 transitions. [2019-09-10 03:55:26,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:55:26,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 03:55:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:26,373 INFO L225 Difference]: With dead ends: 157 [2019-09-10 03:55:26,373 INFO L226 Difference]: Without dead ends: 153 [2019-09-10 03:55:26,375 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 03:55:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-10 03:55:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-09-10 03:55:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-10 03:55:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2019-09-10 03:55:26,432 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 56 [2019-09-10 03:55:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:26,433 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2019-09-10 03:55:26,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2019-09-10 03:55:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 03:55:26,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:26,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:26,438 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:26,439 INFO L82 PathProgramCache]: Analyzing trace with hash -981393308, now seen corresponding path program 1 times [2019-09-10 03:55:26,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:26,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:26,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:26,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:26,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:26,764 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 03:55:26,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:26,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:55:26,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:26,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:55:26,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:55:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:55:26,771 INFO L87 Difference]: Start difference. First operand 153 states and 222 transitions. Second operand 9 states. [2019-09-10 03:55:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:29,783 INFO L93 Difference]: Finished difference Result 861 states and 1322 transitions. [2019-09-10 03:55:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 03:55:29,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 03:55:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:29,800 INFO L225 Difference]: With dead ends: 861 [2019-09-10 03:55:29,800 INFO L226 Difference]: Without dead ends: 861 [2019-09-10 03:55:29,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-10 03:55:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-10 03:55:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 589. [2019-09-10 03:55:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 03:55:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 906 transitions. [2019-09-10 03:55:29,877 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 906 transitions. Word has length 82 [2019-09-10 03:55:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:29,878 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 906 transitions. [2019-09-10 03:55:29,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:55:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 906 transitions. [2019-09-10 03:55:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 03:55:29,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:29,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:29,884 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1956808491, now seen corresponding path program 1 times [2019-09-10 03:55:29,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:29,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:29,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:29,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:29,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:30,083 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 03:55:30,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:30,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:55:30,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:30,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:55:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:55:30,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:30,090 INFO L87 Difference]: Start difference. First operand 589 states and 906 transitions. Second operand 6 states. [2019-09-10 03:55:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:31,241 INFO L93 Difference]: Finished difference Result 1137 states and 1757 transitions. [2019-09-10 03:55:31,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:55:31,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 03:55:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:31,252 INFO L225 Difference]: With dead ends: 1137 [2019-09-10 03:55:31,252 INFO L226 Difference]: Without dead ends: 1137 [2019-09-10 03:55:31,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:55:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-10 03:55:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 863. [2019-09-10 03:55:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-10 03:55:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1330 transitions. [2019-09-10 03:55:31,355 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1330 transitions. Word has length 83 [2019-09-10 03:55:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:31,356 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1330 transitions. [2019-09-10 03:55:31,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:55:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1330 transitions. [2019-09-10 03:55:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 03:55:31,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:31,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:31,369 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2113374267, now seen corresponding path program 1 times [2019-09-10 03:55:31,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:31,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:31,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:31,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:31,564 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 03:55:31,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:31,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:55:31,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:31,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:55:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:55:31,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:31,567 INFO L87 Difference]: Start difference. First operand 863 states and 1330 transitions. Second operand 6 states. [2019-09-10 03:55:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:32,674 INFO L93 Difference]: Finished difference Result 3299 states and 5137 transitions. [2019-09-10 03:55:32,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:55:32,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 03:55:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:32,702 INFO L225 Difference]: With dead ends: 3299 [2019-09-10 03:55:32,703 INFO L226 Difference]: Without dead ends: 3299 [2019-09-10 03:55:32,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:55:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-09-10 03:55:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 2477. [2019-09-10 03:55:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-09-10 03:55:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3850 transitions. [2019-09-10 03:55:32,828 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3850 transitions. Word has length 84 [2019-09-10 03:55:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:32,830 INFO L475 AbstractCegarLoop]: Abstraction has 2477 states and 3850 transitions. [2019-09-10 03:55:32,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:55:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3850 transitions. [2019-09-10 03:55:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:55:32,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:32,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:32,834 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash -611664052, now seen corresponding path program 1 times [2019-09-10 03:55:32,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:32,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:32,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:32,983 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 03:55:32,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:32,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:55:32,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:32,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:55:32,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:55:32,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:32,986 INFO L87 Difference]: Start difference. First operand 2477 states and 3850 transitions. Second operand 6 states. [2019-09-10 03:55:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:34,355 INFO L93 Difference]: Finished difference Result 9846 states and 15265 transitions. [2019-09-10 03:55:34,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:55:34,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-10 03:55:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:34,443 INFO L225 Difference]: With dead ends: 9846 [2019-09-10 03:55:34,444 INFO L226 Difference]: Without dead ends: 9846 [2019-09-10 03:55:34,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:55:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2019-09-10 03:55:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 9792. [2019-09-10 03:55:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9792 states. [2019-09-10 03:55:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9792 states to 9792 states and 15169 transitions. [2019-09-10 03:55:34,949 INFO L78 Accepts]: Start accepts. Automaton has 9792 states and 15169 transitions. Word has length 85 [2019-09-10 03:55:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:34,951 INFO L475 AbstractCegarLoop]: Abstraction has 9792 states and 15169 transitions. [2019-09-10 03:55:34,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:55:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 9792 states and 15169 transitions. [2019-09-10 03:55:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 03:55:34,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:34,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:34,958 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:34,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1246306044, now seen corresponding path program 1 times [2019-09-10 03:55:34,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:34,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:34,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:35,062 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 03:55:35,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:35,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:35,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:35,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:35,066 INFO L87 Difference]: Start difference. First operand 9792 states and 15169 transitions. Second operand 4 states. [2019-09-10 03:55:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:35,348 INFO L93 Difference]: Finished difference Result 25089 states and 38453 transitions. [2019-09-10 03:55:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:35,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-10 03:55:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:35,530 INFO L225 Difference]: With dead ends: 25089 [2019-09-10 03:55:35,531 INFO L226 Difference]: Without dead ends: 25089 [2019-09-10 03:55:35,531 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 03:55:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25089 states. [2019-09-10 03:55:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25089 to 24760. [2019-09-10 03:55:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24760 states. [2019-09-10 03:55:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24760 states to 24760 states and 38019 transitions. [2019-09-10 03:55:36,460 INFO L78 Accepts]: Start accepts. Automaton has 24760 states and 38019 transitions. Word has length 87 [2019-09-10 03:55:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:36,461 INFO L475 AbstractCegarLoop]: Abstraction has 24760 states and 38019 transitions. [2019-09-10 03:55:36,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 24760 states and 38019 transitions. [2019-09-10 03:55:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 03:55:36,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:36,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:36,473 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash -278154154, now seen corresponding path program 1 times [2019-09-10 03:55:36,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:36,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:36,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:36,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:55:36,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:36,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:36,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:36,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:36,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:36,545 INFO L87 Difference]: Start difference. First operand 24760 states and 38019 transitions. Second operand 5 states. [2019-09-10 03:55:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:38,134 INFO L93 Difference]: Finished difference Result 50324 states and 78736 transitions. [2019-09-10 03:55:38,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:38,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 03:55:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:38,427 INFO L225 Difference]: With dead ends: 50324 [2019-09-10 03:55:38,427 INFO L226 Difference]: Without dead ends: 50324 [2019-09-10 03:55:38,428 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 03:55:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50324 states. [2019-09-10 03:55:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50324 to 50055. [2019-09-10 03:55:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50055 states. [2019-09-10 03:55:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50055 states to 50055 states and 77888 transitions. [2019-09-10 03:55:39,826 INFO L78 Accepts]: Start accepts. Automaton has 50055 states and 77888 transitions. Word has length 87 [2019-09-10 03:55:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:39,827 INFO L475 AbstractCegarLoop]: Abstraction has 50055 states and 77888 transitions. [2019-09-10 03:55:39,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 50055 states and 77888 transitions. [2019-09-10 03:55:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 03:55:39,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:39,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:39,831 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1277532705, now seen corresponding path program 1 times [2019-09-10 03:55:39,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:39,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:39,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:39,938 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 03:55:39,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:39,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 03:55:39,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:39,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:55:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:55:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:55:39,940 INFO L87 Difference]: Start difference. First operand 50055 states and 77888 transitions. Second operand 7 states. [2019-09-10 03:55:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:41,522 INFO L93 Difference]: Finished difference Result 69985 states and 109187 transitions. [2019-09-10 03:55:41,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:55:41,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 03:55:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:41,829 INFO L225 Difference]: With dead ends: 69985 [2019-09-10 03:55:41,829 INFO L226 Difference]: Without dead ends: 69985 [2019-09-10 03:55:41,830 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 03:55:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69985 states. [2019-09-10 03:55:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69985 to 69811. [2019-09-10 03:55:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69811 states. [2019-09-10 03:55:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69811 states to 69811 states and 108926 transitions. [2019-09-10 03:55:44,887 INFO L78 Accepts]: Start accepts. Automaton has 69811 states and 108926 transitions. Word has length 88 [2019-09-10 03:55:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:44,887 INFO L475 AbstractCegarLoop]: Abstraction has 69811 states and 108926 transitions. [2019-09-10 03:55:44,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:55:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 69811 states and 108926 transitions. [2019-09-10 03:55:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 03:55:44,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:44,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:44,895 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -883096152, now seen corresponding path program 1 times [2019-09-10 03:55:44,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:44,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:44,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:44,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:44,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:45,435 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 03:55:45,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:45,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 03:55:45,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:45,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:55:45,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:55:45,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:55:45,437 INFO L87 Difference]: Start difference. First operand 69811 states and 108926 transitions. Second operand 11 states. [2019-09-10 03:55:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:47,510 INFO L93 Difference]: Finished difference Result 93283 states and 152584 transitions. [2019-09-10 03:55:47,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:55:47,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-09-10 03:55:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:47,916 INFO L225 Difference]: With dead ends: 93283 [2019-09-10 03:55:47,916 INFO L226 Difference]: Without dead ends: 93283 [2019-09-10 03:55:47,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:55:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93283 states. [2019-09-10 03:55:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93283 to 71893. [2019-09-10 03:55:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71893 states. [2019-09-10 03:55:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71893 states to 71893 states and 113602 transitions. [2019-09-10 03:55:50,646 INFO L78 Accepts]: Start accepts. Automaton has 71893 states and 113602 transitions. Word has length 88 [2019-09-10 03:55:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:50,647 INFO L475 AbstractCegarLoop]: Abstraction has 71893 states and 113602 transitions. [2019-09-10 03:55:50,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:55:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 71893 states and 113602 transitions. [2019-09-10 03:55:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 03:55:50,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:50,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:50,651 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash -787786110, now seen corresponding path program 1 times [2019-09-10 03:55:50,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:50,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:50,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:50,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:50,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:50,801 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 03:55:50,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:50,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 03:55:50,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:50,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:55:50,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:55:50,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:55:50,803 INFO L87 Difference]: Start difference. First operand 71893 states and 113602 transitions. Second operand 11 states. [2019-09-10 03:55:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:54,903 INFO L93 Difference]: Finished difference Result 98540 states and 163052 transitions. [2019-09-10 03:55:54,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:55:54,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-09-10 03:55:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:55,378 INFO L225 Difference]: With dead ends: 98540 [2019-09-10 03:55:55,379 INFO L226 Difference]: Without dead ends: 98539 [2019-09-10 03:55:55,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:55:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98539 states. [2019-09-10 03:55:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98539 to 71630. [2019-09-10 03:55:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71630 states. [2019-09-10 03:55:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71630 states to 71630 states and 112325 transitions. [2019-09-10 03:55:57,543 INFO L78 Accepts]: Start accepts. Automaton has 71630 states and 112325 transitions. Word has length 88 [2019-09-10 03:55:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:57,544 INFO L475 AbstractCegarLoop]: Abstraction has 71630 states and 112325 transitions. [2019-09-10 03:55:57,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:55:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 71630 states and 112325 transitions. [2019-09-10 03:55:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:55:57,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:57,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:57,547 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:57,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash -311105867, now seen corresponding path program 1 times [2019-09-10 03:55:57,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:57,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:57,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:57,667 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 03:55:57,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:57,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:57,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:57,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:57,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:57,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:57,670 INFO L87 Difference]: Start difference. First operand 71630 states and 112325 transitions. Second operand 5 states. [2019-09-10 03:55:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:58,206 INFO L93 Difference]: Finished difference Result 141661 states and 219221 transitions. [2019-09-10 03:55:58,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:55:58,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 03:55:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:58,691 INFO L225 Difference]: With dead ends: 141661 [2019-09-10 03:55:58,691 INFO L226 Difference]: Without dead ends: 141661 [2019-09-10 03:55:58,692 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 03:55:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141661 states. [2019-09-10 03:56:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141661 to 141659. [2019-09-10 03:56:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141659 states. [2019-09-10 03:56:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141659 states to 141659 states and 219220 transitions. [2019-09-10 03:56:03,900 INFO L78 Accepts]: Start accepts. Automaton has 141659 states and 219220 transitions. Word has length 89 [2019-09-10 03:56:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:03,900 INFO L475 AbstractCegarLoop]: Abstraction has 141659 states and 219220 transitions. [2019-09-10 03:56:03,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 141659 states and 219220 transitions. [2019-09-10 03:56:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 03:56:03,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:03,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:03,904 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:03,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:03,904 INFO L82 PathProgramCache]: Analyzing trace with hash -92550679, now seen corresponding path program 1 times [2019-09-10 03:56:03,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:03,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:03,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:03,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:03,942 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 03:56:03,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:03,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:56:03,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:03,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:56:03,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:56:03,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:56:03,944 INFO L87 Difference]: Start difference. First operand 141659 states and 219220 transitions. Second operand 3 states. [2019-09-10 03:56:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:04,725 INFO L93 Difference]: Finished difference Result 141755 states and 219338 transitions. [2019-09-10 03:56:04,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:56:04,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 03:56:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:05,265 INFO L225 Difference]: With dead ends: 141755 [2019-09-10 03:56:05,266 INFO L226 Difference]: Without dead ends: 141755 [2019-09-10 03:56:05,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:56:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141755 states. [2019-09-10 03:56:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141755 to 141661. [2019-09-10 03:56:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141661 states. [2019-09-10 03:56:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141661 states to 141661 states and 219222 transitions. [2019-09-10 03:56:12,060 INFO L78 Accepts]: Start accepts. Automaton has 141661 states and 219222 transitions. Word has length 90 [2019-09-10 03:56:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:12,060 INFO L475 AbstractCegarLoop]: Abstraction has 141661 states and 219222 transitions. [2019-09-10 03:56:12,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:56:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 141661 states and 219222 transitions. [2019-09-10 03:56:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:56:12,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:12,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:12,064 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:12,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash 988708442, now seen corresponding path program 1 times [2019-09-10 03:56:12,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:12,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:12,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:12,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:12,218 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 03:56:12,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:12,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:56:12,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:12,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:56:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:56:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:12,220 INFO L87 Difference]: Start difference. First operand 141661 states and 219222 transitions. Second operand 5 states. [2019-09-10 03:56:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:13,217 INFO L93 Difference]: Finished difference Result 280124 states and 427579 transitions. [2019-09-10 03:56:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:56:13,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 03:56:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:14,017 INFO L225 Difference]: With dead ends: 280124 [2019-09-10 03:56:14,018 INFO L226 Difference]: Without dead ends: 280124 [2019-09-10 03:56:14,018 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 03:56:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280124 states. [2019-09-10 03:56:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280124 to 280122. [2019-09-10 03:56:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280122 states. [2019-09-10 03:56:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280122 states to 280122 states and 427578 transitions. [2019-09-10 03:56:21,982 INFO L78 Accepts]: Start accepts. Automaton has 280122 states and 427578 transitions. Word has length 91 [2019-09-10 03:56:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:21,982 INFO L475 AbstractCegarLoop]: Abstraction has 280122 states and 427578 transitions. [2019-09-10 03:56:21,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 280122 states and 427578 transitions. [2019-09-10 03:56:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:56:21,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:21,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:21,990 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash -895226652, now seen corresponding path program 1 times [2019-09-10 03:56:21,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:21,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:21,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:21,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:22,077 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 03:56:22,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:22,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:56:22,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:22,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:56:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:56:22,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:22,079 INFO L87 Difference]: Start difference. First operand 280122 states and 427578 transitions. Second operand 5 states. [2019-09-10 03:56:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:27,173 INFO L93 Difference]: Finished difference Result 320140 states and 474971 transitions. [2019-09-10 03:56:27,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:56:27,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 03:56:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:28,027 INFO L225 Difference]: With dead ends: 320140 [2019-09-10 03:56:28,028 INFO L226 Difference]: Without dead ends: 320140 [2019-09-10 03:56:28,028 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 03:56:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320140 states. [2019-09-10 03:56:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320140 to 313502. [2019-09-10 03:56:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313502 states. [2019-09-10 03:56:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313502 states to 313502 states and 463126 transitions. [2019-09-10 03:56:33,158 INFO L78 Accepts]: Start accepts. Automaton has 313502 states and 463126 transitions. Word has length 91 [2019-09-10 03:56:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:33,159 INFO L475 AbstractCegarLoop]: Abstraction has 313502 states and 463126 transitions. [2019-09-10 03:56:33,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 313502 states and 463126 transitions. [2019-09-10 03:56:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:56:33,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:33,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:33,163 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1531600991, now seen corresponding path program 1 times [2019-09-10 03:56:33,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:33,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:33,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:33,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:56:33,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:33,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:56:33,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:33,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:56:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:56:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:56:33,252 INFO L87 Difference]: Start difference. First operand 313502 states and 463126 transitions. Second operand 4 states. [2019-09-10 03:56:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:33,957 INFO L93 Difference]: Finished difference Result 236854 states and 350444 transitions. [2019-09-10 03:56:33,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:56:33,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 03:56:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:34,528 INFO L225 Difference]: With dead ends: 236854 [2019-09-10 03:56:34,529 INFO L226 Difference]: Without dead ends: 236795 [2019-09-10 03:56:34,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236795 states. [2019-09-10 03:56:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236795 to 236795. [2019-09-10 03:56:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236795 states. [2019-09-10 03:56:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236795 states to 236795 states and 350365 transitions. [2019-09-10 03:56:43,730 INFO L78 Accepts]: Start accepts. Automaton has 236795 states and 350365 transitions. Word has length 91 [2019-09-10 03:56:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:43,730 INFO L475 AbstractCegarLoop]: Abstraction has 236795 states and 350365 transitions. [2019-09-10 03:56:43,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:56:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 236795 states and 350365 transitions. [2019-09-10 03:56:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 03:56:43,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:43,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:43,733 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1434429109, now seen corresponding path program 1 times [2019-09-10 03:56:43,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:43,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:43,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:43,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:43,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:43,842 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 03:56:43,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:43,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:56:43,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:43,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:56:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:56:43,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:43,845 INFO L87 Difference]: Start difference. First operand 236795 states and 350365 transitions. Second operand 5 states. [2019-09-10 03:56:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:46,905 INFO L93 Difference]: Finished difference Result 351923 states and 512992 transitions. [2019-09-10 03:56:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:56:46,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 03:56:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:47,755 INFO L225 Difference]: With dead ends: 351923 [2019-09-10 03:56:47,756 INFO L226 Difference]: Without dead ends: 351923 [2019-09-10 03:56:47,756 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 03:56:47,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351923 states. [2019-09-10 03:56:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351923 to 327708. [2019-09-10 03:56:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327708 states. [2019-09-10 03:56:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327708 states to 327708 states and 488226 transitions. [2019-09-10 03:56:59,187 INFO L78 Accepts]: Start accepts. Automaton has 327708 states and 488226 transitions. Word has length 93 [2019-09-10 03:56:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:59,188 INFO L475 AbstractCegarLoop]: Abstraction has 327708 states and 488226 transitions. [2019-09-10 03:56:59,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 327708 states and 488226 transitions. [2019-09-10 03:56:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 03:56:59,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:59,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:59,191 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2142671705, now seen corresponding path program 1 times [2019-09-10 03:56:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:59,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:59,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:59,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:59,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:59,263 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 03:56:59,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:59,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:56:59,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:59,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:56:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:56:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:56:59,265 INFO L87 Difference]: Start difference. First operand 327708 states and 488226 transitions. Second operand 4 states. [2019-09-10 03:57:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:57:02,238 INFO L93 Difference]: Finished difference Result 580893 states and 848910 transitions. [2019-09-10 03:57:02,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:57:02,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 03:57:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:57:11,231 INFO L225 Difference]: With dead ends: 580893 [2019-09-10 03:57:11,231 INFO L226 Difference]: Without dead ends: 580893 [2019-09-10 03:57:11,232 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 03:57:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580893 states. [2019-09-10 03:57:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580893 to 580889. [2019-09-10 03:57:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580889 states. [2019-09-10 03:57:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580889 states to 580889 states and 848908 transitions. [2019-09-10 03:57:32,469 INFO L78 Accepts]: Start accepts. Automaton has 580889 states and 848908 transitions. Word has length 93 [2019-09-10 03:57:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:57:32,469 INFO L475 AbstractCegarLoop]: Abstraction has 580889 states and 848908 transitions. [2019-09-10 03:57:32,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:57:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 580889 states and 848908 transitions. [2019-09-10 03:57:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 03:57:32,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:57:32,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:57:32,474 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:57:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:57:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1446688205, now seen corresponding path program 1 times [2019-09-10 03:57:32,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:57:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:57:32,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:57:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:57:32,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:57:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:57:32,590 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 03:57:32,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:57:32,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 03:57:32,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:57:32,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:57:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:57:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:57:32,592 INFO L87 Difference]: Start difference. First operand 580889 states and 848908 transitions. Second operand 10 states. [2019-09-10 03:57:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:57:37,987 INFO L93 Difference]: Finished difference Result 749596 states and 1107498 transitions. [2019-09-10 03:57:37,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:57:37,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 03:57:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:57:50,661 INFO L225 Difference]: With dead ends: 749596 [2019-09-10 03:57:50,661 INFO L226 Difference]: Without dead ends: 749548 [2019-09-10 03:57:50,662 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 03:57:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749548 states. [2019-09-10 03:57:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749548 to 580889. [2019-09-10 03:57:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580889 states. [2019-09-10 03:58:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580889 states to 580889 states and 848906 transitions. [2019-09-10 03:58:10,369 INFO L78 Accepts]: Start accepts. Automaton has 580889 states and 848906 transitions. Word has length 94 [2019-09-10 03:58:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:10,369 INFO L475 AbstractCegarLoop]: Abstraction has 580889 states and 848906 transitions. [2019-09-10 03:58:10,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:58:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 580889 states and 848906 transitions. [2019-09-10 03:58:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 03:58:10,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:10,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:58:10,373 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1306139595, now seen corresponding path program 1 times [2019-09-10 03:58:10,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:10,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:10,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:10,487 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 03:58:10,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:10,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:58:10,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:10,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:58:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:58:10,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:58:10,491 INFO L87 Difference]: Start difference. First operand 580889 states and 848906 transitions. Second operand 9 states. [2019-09-10 03:58:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:18,916 INFO L93 Difference]: Finished difference Result 843488 states and 1232934 transitions. [2019-09-10 03:58:18,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 03:58:18,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 03:58:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:30,141 INFO L225 Difference]: With dead ends: 843488 [2019-09-10 03:58:30,142 INFO L226 Difference]: Without dead ends: 843488 [2019-09-10 03:58:30,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:58:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843488 states. [2019-09-10 03:58:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843488 to 639378. [2019-09-10 03:58:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639378 states. [2019-09-10 03:58:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639378 states to 639378 states and 930782 transitions. [2019-09-10 03:58:44,525 INFO L78 Accepts]: Start accepts. Automaton has 639378 states and 930782 transitions. Word has length 94 [2019-09-10 03:58:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:44,526 INFO L475 AbstractCegarLoop]: Abstraction has 639378 states and 930782 transitions. [2019-09-10 03:58:44,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:58:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 639378 states and 930782 transitions. [2019-09-10 03:58:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 03:58:44,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:44,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:58:44,529 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 896462566, now seen corresponding path program 1 times [2019-09-10 03:58:44,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:44,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:44,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:44,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:44,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:44,639 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 03:58:44,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:44,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:58:44,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:44,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:58:44,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:58:44,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:58:44,641 INFO L87 Difference]: Start difference. First operand 639378 states and 930782 transitions. Second operand 5 states. [2019-09-10 03:58:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:58,670 INFO L93 Difference]: Finished difference Result 1257636 states and 1806344 transitions. [2019-09-10 03:58:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:58:58,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 03:58:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:03,546 INFO L225 Difference]: With dead ends: 1257636 [2019-09-10 03:59:03,547 INFO L226 Difference]: Without dead ends: 1257636 [2019-09-10 03:59:03,547 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 03:59:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257636 states. [2019-09-10 03:59:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257636 to 1257634. [2019-09-10 03:59:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257634 states. [2019-09-10 04:00:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257634 states to 1257634 states and 1806343 transitions. [2019-09-10 04:00:07,248 INFO L78 Accepts]: Start accepts. Automaton has 1257634 states and 1806343 transitions. Word has length 95 [2019-09-10 04:00:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:00:07,248 INFO L475 AbstractCegarLoop]: Abstraction has 1257634 states and 1806343 transitions. [2019-09-10 04:00:07,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:00:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1257634 states and 1806343 transitions. [2019-09-10 04:00:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:00:07,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:00:07,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:00:07,255 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:00:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:00:07,256 INFO L82 PathProgramCache]: Analyzing trace with hash -864175734, now seen corresponding path program 1 times [2019-09-10 04:00:07,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:00:07,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:07,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:00:07,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:07,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:00:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:00:07,343 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:00:07,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:00:07,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:00:07,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:00:07,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:00:07,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:00:07,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:00:07,345 INFO L87 Difference]: Start difference. First operand 1257634 states and 1806343 transitions. Second operand 7 states. [2019-09-10 04:00:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:00:25,540 INFO L93 Difference]: Finished difference Result 1529342 states and 2197890 transitions. [2019-09-10 04:00:25,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:00:25,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-09-10 04:00:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:00:42,064 INFO L225 Difference]: With dead ends: 1529342 [2019-09-10 04:00:42,064 INFO L226 Difference]: Without dead ends: 1529342 [2019-09-10 04:00:42,064 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:00:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529342 states.