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.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:58:34,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:58:34,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:58:34,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:58:34,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:58:34,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:58:34,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:58:34,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:58:34,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:58:34,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:58:34,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:58:34,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:58:34,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:58:34,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:58:34,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:58:34,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:58:34,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:58:34,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:58:34,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:58:34,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:58:34,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:58:34,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:58:34,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:58:34,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:58:34,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:58:34,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:58:34,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:58:34,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:58:34,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:58:34,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:58:34,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:58:34,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:58:34,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:58:34,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:58:34,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:58:34,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:58:34,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:58:34,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:58:34,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:58:34,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:58:34,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:58:34,865 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:58:34,884 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:58:34,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:58:34,884 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:58:34,885 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:58:34,885 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:58:34,886 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:58:34,886 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:58:34,886 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:58:34,886 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:58:34,886 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:58:34,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:58:34,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:58:34,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:58:34,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:58:34,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:58:34,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:58:34,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:58:34,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:58:34,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:58:34,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:58:34,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:58:34,891 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:58:34,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:58:34,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:58:34,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:58:34,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:58:34,892 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:58:34,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:58:34,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:58:34,893 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:58:34,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:58:34,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:58:34,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:58:34,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:58:34,967 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:58:34,968 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2019-09-10 03:58:35,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88a27a1a/728fd46abc6e4a0da7c95506c0ca26f9/FLAG15496f2f4 [2019-09-10 03:58:35,534 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:58:35,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2019-09-10 03:58:35,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88a27a1a/728fd46abc6e4a0da7c95506c0ca26f9/FLAG15496f2f4 [2019-09-10 03:58:35,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88a27a1a/728fd46abc6e4a0da7c95506c0ca26f9 [2019-09-10 03:58:35,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:58:35,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:58:35,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:58:35,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:58:35,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:58:35,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:58:35" (1/1) ... [2019-09-10 03:58:35,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1677a6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:35, skipping insertion in model container [2019-09-10 03:58:35,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:58:35" (1/1) ... [2019-09-10 03:58:35,914 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:58:35,963 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:58:36,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:58:36,296 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:58:36,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:58:36,385 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:58:36,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36 WrapperNode [2019-09-10 03:58:36,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:58:36,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:58:36,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:58:36,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:58:36,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (1/1) ... [2019-09-10 03:58:36,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (1/1) ... [2019-09-10 03:58:36,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (1/1) ... [2019-09-10 03:58:36,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (1/1) ... [2019-09-10 03:58:36,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (1/1) ... [2019-09-10 03:58:36,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (1/1) ... [2019-09-10 03:58:36,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (1/1) ... [2019-09-10 03:58:36,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:58:36,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:58:36,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:58:36,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:58:36,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (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:58:36,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:58:36,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:58:36,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 03:58:36,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 03:58:36,518 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 03:58:36,518 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 03:58:36,518 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 03:58:36,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:58:36,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 03:58:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:58:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 03:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 03:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 03:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 03:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 03:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 03:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 03:58:36,520 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 03:58:36,520 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 03:58:36,520 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 03:58:36,520 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 03:58:36,520 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 03:58:36,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:58:36,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:58:36,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:58:37,385 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:58:37,385 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 03:58:37,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:58:37 BoogieIcfgContainer [2019-09-10 03:58:37,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:58:37,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:58:37,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:58:37,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:58:37,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:58:35" (1/3) ... [2019-09-10 03:58:37,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c36b361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:58:37, skipping insertion in model container [2019-09-10 03:58:37,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:58:36" (2/3) ... [2019-09-10 03:58:37,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c36b361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:58:37, skipping insertion in model container [2019-09-10 03:58:37,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:58:37" (3/3) ... [2019-09-10 03:58:37,395 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c [2019-09-10 03:58:37,404 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:58:37,413 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:58:37,430 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:58:37,458 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:58:37,458 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:58:37,459 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:58:37,459 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:58:37,459 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:58:37,459 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:58:37,459 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:58:37,460 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:58:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-09-10 03:58:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 03:58:37,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:37,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:58:37,500 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash 599968013, now seen corresponding path program 1 times [2019-09-10 03:58:37,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:37,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:37,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:37,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:37,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:37,954 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:37,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:37,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:58:37,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:37,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:58:37,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:58:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:58:37,983 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 5 states. [2019-09-10 03:58:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:38,124 INFO L93 Difference]: Finished difference Result 157 states and 252 transitions. [2019-09-10 03:58:38,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:58:38,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 03:58:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:38,140 INFO L225 Difference]: With dead ends: 157 [2019-09-10 03:58:38,141 INFO L226 Difference]: Without dead ends: 153 [2019-09-10 03:58:38,145 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:58:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-10 03:58:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-09-10 03:58:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-10 03:58:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2019-09-10 03:58:38,201 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 56 [2019-09-10 03:58:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:38,202 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2019-09-10 03:58:38,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:58:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2019-09-10 03:58:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 03:58:38,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:38,206 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:58:38,207 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:38,207 INFO L82 PathProgramCache]: Analyzing trace with hash -981393308, now seen corresponding path program 1 times [2019-09-10 03:58:38,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:38,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:38,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:38,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:38,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:38,493 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:38,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:38,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:58:38,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:38,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:58:38,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:58:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:58:38,497 INFO L87 Difference]: Start difference. First operand 153 states and 222 transitions. Second operand 9 states. [2019-09-10 03:58:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:41,405 INFO L93 Difference]: Finished difference Result 861 states and 1322 transitions. [2019-09-10 03:58:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 03:58:41,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 03:58:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:41,432 INFO L225 Difference]: With dead ends: 861 [2019-09-10 03:58:41,434 INFO L226 Difference]: Without dead ends: 861 [2019-09-10 03:58:41,436 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:58:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-10 03:58:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 589. [2019-09-10 03:58:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 03:58:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 906 transitions. [2019-09-10 03:58:41,524 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 906 transitions. Word has length 82 [2019-09-10 03:58:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:41,525 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 906 transitions. [2019-09-10 03:58:41,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:58:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 906 transitions. [2019-09-10 03:58:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 03:58:41,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:41,530 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:58:41,530 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:41,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1956808491, now seen corresponding path program 1 times [2019-09-10 03:58:41,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:41,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:41,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:58:41,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:41,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:58:41,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:41,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:58:41,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:58:41,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:58:41,737 INFO L87 Difference]: Start difference. First operand 589 states and 906 transitions. Second operand 6 states. [2019-09-10 03:58:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:42,853 INFO L93 Difference]: Finished difference Result 1137 states and 1757 transitions. [2019-09-10 03:58:42,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:58:42,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 03:58:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:42,862 INFO L225 Difference]: With dead ends: 1137 [2019-09-10 03:58:42,863 INFO L226 Difference]: Without dead ends: 1137 [2019-09-10 03:58:42,863 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:58:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-10 03:58:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 863. [2019-09-10 03:58:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-10 03:58:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1330 transitions. [2019-09-10 03:58:42,924 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1330 transitions. Word has length 83 [2019-09-10 03:58:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:42,925 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1330 transitions. [2019-09-10 03:58:42,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:58:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1330 transitions. [2019-09-10 03:58:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 03:58:42,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:42,930 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:58:42,930 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:42,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2113374267, now seen corresponding path program 1 times [2019-09-10 03:58:42,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:42,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:42,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:42,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:42,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:43,078 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:43,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:43,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:58:43,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:43,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:58:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:58:43,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:58:43,081 INFO L87 Difference]: Start difference. First operand 863 states and 1330 transitions. Second operand 6 states. [2019-09-10 03:58:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:44,207 INFO L93 Difference]: Finished difference Result 3299 states and 5137 transitions. [2019-09-10 03:58:44,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:58:44,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 03:58:44,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:44,235 INFO L225 Difference]: With dead ends: 3299 [2019-09-10 03:58:44,235 INFO L226 Difference]: Without dead ends: 3299 [2019-09-10 03:58:44,236 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:58:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-09-10 03:58:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 2477. [2019-09-10 03:58:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-09-10 03:58:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3850 transitions. [2019-09-10 03:58:44,370 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3850 transitions. Word has length 84 [2019-09-10 03:58:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:44,370 INFO L475 AbstractCegarLoop]: Abstraction has 2477 states and 3850 transitions. [2019-09-10 03:58:44,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:58:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3850 transitions. [2019-09-10 03:58:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:58:44,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:44,374 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:58:44,375 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -611664052, now seen corresponding path program 1 times [2019-09-10 03:58:44,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:44,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:44,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:44,500 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,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:44,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:58:44,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:44,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:58:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:58:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:58:44,504 INFO L87 Difference]: Start difference. First operand 2477 states and 3850 transitions. Second operand 6 states. [2019-09-10 03:58:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:45,881 INFO L93 Difference]: Finished difference Result 9846 states and 15265 transitions. [2019-09-10 03:58:45,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:58:45,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-10 03:58:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:45,947 INFO L225 Difference]: With dead ends: 9846 [2019-09-10 03:58:45,948 INFO L226 Difference]: Without dead ends: 9846 [2019-09-10 03:58:45,948 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:58:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2019-09-10 03:58:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 9792. [2019-09-10 03:58:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9792 states. [2019-09-10 03:58:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9792 states to 9792 states and 15169 transitions. [2019-09-10 03:58:46,302 INFO L78 Accepts]: Start accepts. Automaton has 9792 states and 15169 transitions. Word has length 85 [2019-09-10 03:58:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:46,303 INFO L475 AbstractCegarLoop]: Abstraction has 9792 states and 15169 transitions. [2019-09-10 03:58:46,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:58:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9792 states and 15169 transitions. [2019-09-10 03:58:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 03:58:46,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:46,307 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:58:46,307 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:46,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:46,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1246306044, now seen corresponding path program 1 times [2019-09-10 03:58:46,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:46,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:46,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:46,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:46,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:46,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:46,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:46,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:58:46,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:46,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:58:46,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:58:46,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:58:46,489 INFO L87 Difference]: Start difference. First operand 9792 states and 15169 transitions. Second operand 4 states. [2019-09-10 03:58:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:46,736 INFO L93 Difference]: Finished difference Result 25089 states and 38453 transitions. [2019-09-10 03:58:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:58:46,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-10 03:58:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:46,889 INFO L225 Difference]: With dead ends: 25089 [2019-09-10 03:58:46,890 INFO L226 Difference]: Without dead ends: 25089 [2019-09-10 03:58:46,890 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:58:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25089 states. [2019-09-10 03:58:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25089 to 24760. [2019-09-10 03:58:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24760 states. [2019-09-10 03:58:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24760 states to 24760 states and 38019 transitions. [2019-09-10 03:58:47,850 INFO L78 Accepts]: Start accepts. Automaton has 24760 states and 38019 transitions. Word has length 87 [2019-09-10 03:58:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:47,851 INFO L475 AbstractCegarLoop]: Abstraction has 24760 states and 38019 transitions. [2019-09-10 03:58:47,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:58:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24760 states and 38019 transitions. [2019-09-10 03:58:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 03:58:47,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:47,855 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:58:47,855 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:47,856 INFO L82 PathProgramCache]: Analyzing trace with hash 231318936, now seen corresponding path program 1 times [2019-09-10 03:58:47,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:47,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:47,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:47,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:47,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:48,009 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:48,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:58:48,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:48,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:58:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:58:48,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:58:48,013 INFO L87 Difference]: Start difference. First operand 24760 states and 38019 transitions. Second operand 9 states. [2019-09-10 03:58:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:51,448 INFO L93 Difference]: Finished difference Result 33401 states and 51407 transitions. [2019-09-10 03:58:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 03:58:51,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 03:58:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:51,620 INFO L225 Difference]: With dead ends: 33401 [2019-09-10 03:58:51,620 INFO L226 Difference]: Without dead ends: 33401 [2019-09-10 03:58:51,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:58:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33401 states. [2019-09-10 03:58:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33401 to 28096. [2019-09-10 03:58:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28096 states. [2019-09-10 03:58:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28096 states to 28096 states and 43044 transitions. [2019-09-10 03:58:52,465 INFO L78 Accepts]: Start accepts. Automaton has 28096 states and 43044 transitions. Word has length 87 [2019-09-10 03:58:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:52,466 INFO L475 AbstractCegarLoop]: Abstraction has 28096 states and 43044 transitions. [2019-09-10 03:58:52,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:58:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28096 states and 43044 transitions. [2019-09-10 03:58:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 03:58:52,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:52,470 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:58:52,470 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:52,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:52,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1277532705, now seen corresponding path program 1 times [2019-09-10 03:58:52,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:52,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:52,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:52,694 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:52,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:52,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 03:58:52,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:52,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:58:52,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:58:52,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:58:52,697 INFO L87 Difference]: Start difference. First operand 28096 states and 43044 transitions. Second operand 10 states. [2019-09-10 03:58:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:57,362 INFO L93 Difference]: Finished difference Result 51926 states and 81461 transitions. [2019-09-10 03:58:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 03:58:57,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 03:58:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:57,611 INFO L225 Difference]: With dead ends: 51926 [2019-09-10 03:58:57,612 INFO L226 Difference]: Without dead ends: 51926 [2019-09-10 03:58:57,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 03:58:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51926 states. [2019-09-10 03:58:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51926 to 41840. [2019-09-10 03:58:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41840 states. [2019-09-10 03:58:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41840 states to 41840 states and 64318 transitions. [2019-09-10 03:58:58,894 INFO L78 Accepts]: Start accepts. Automaton has 41840 states and 64318 transitions. Word has length 88 [2019-09-10 03:58:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:58,895 INFO L475 AbstractCegarLoop]: Abstraction has 41840 states and 64318 transitions. [2019-09-10 03:58:58,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:58:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 41840 states and 64318 transitions. [2019-09-10 03:58:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 03:58:58,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:58,900 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:58:58,900 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1631231197, now seen corresponding path program 1 times [2019-09-10 03:58:58,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:58,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:58,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:58,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:58,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:58:58,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:58,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:58:58,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:58,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:58:58,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:58:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:58:58,992 INFO L87 Difference]: Start difference. First operand 41840 states and 64318 transitions. Second operand 5 states. [2019-09-10 03:59:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:00,592 INFO L93 Difference]: Finished difference Result 71693 states and 111922 transitions. [2019-09-10 03:59:00,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:59:00,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-10 03:59:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:00,902 INFO L225 Difference]: With dead ends: 71693 [2019-09-10 03:59:00,902 INFO L226 Difference]: Without dead ends: 71693 [2019-09-10 03:59:00,904 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:59:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71693 states. [2019-09-10 03:59:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71693 to 71177. [2019-09-10 03:59:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71177 states. [2019-09-10 03:59:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71177 states to 71177 states and 110533 transitions. [2019-09-10 03:59:02,724 INFO L78 Accepts]: Start accepts. Automaton has 71177 states and 110533 transitions. Word has length 88 [2019-09-10 03:59:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:59:02,724 INFO L475 AbstractCegarLoop]: Abstraction has 71177 states and 110533 transitions. [2019-09-10 03:59:02,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:59:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 71177 states and 110533 transitions. [2019-09-10 03:59:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:59:02,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:59:02,729 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:59:02,729 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:59:02,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:59:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -311105867, now seen corresponding path program 1 times [2019-09-10 03:59:02,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:59:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:02,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:59:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:02,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:59:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:59:02,907 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:59:02,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:59:02,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:59:02,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:59:02,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:59:02,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:59:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:59:02,921 INFO L87 Difference]: Start difference. First operand 71177 states and 110533 transitions. Second operand 5 states. [2019-09-10 03:59:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:03,664 INFO L93 Difference]: Finished difference Result 140826 states and 215876 transitions. [2019-09-10 03:59:03,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:59:03,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 03:59:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:04,291 INFO L225 Difference]: With dead ends: 140826 [2019-09-10 03:59:04,291 INFO L226 Difference]: Without dead ends: 140826 [2019-09-10 03:59:04,292 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,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140826 states. [2019-09-10 03:59:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140826 to 140824. [2019-09-10 03:59:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140824 states. [2019-09-10 03:59:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140824 states to 140824 states and 215875 transitions. [2019-09-10 03:59:09,405 INFO L78 Accepts]: Start accepts. Automaton has 140824 states and 215875 transitions. Word has length 89 [2019-09-10 03:59:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:59:09,406 INFO L475 AbstractCegarLoop]: Abstraction has 140824 states and 215875 transitions. [2019-09-10 03:59:09,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:59:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 140824 states and 215875 transitions. [2019-09-10 03:59:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:59:09,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:59:09,414 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:59:09,415 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:59:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:59:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1090403345, now seen corresponding path program 1 times [2019-09-10 03:59:09,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:59:09,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:09,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:59:09,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:09,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:59:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:59:09,690 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:59:09,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:59:09,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 03:59:09,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:59:09,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:59:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:59:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:59:09,692 INFO L87 Difference]: Start difference. First operand 140824 states and 215875 transitions. Second operand 11 states. [2019-09-10 03:59:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:15,086 INFO L93 Difference]: Finished difference Result 195244 states and 311892 transitions. [2019-09-10 03:59:15,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:59:15,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 03:59:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:15,847 INFO L225 Difference]: With dead ends: 195244 [2019-09-10 03:59:15,847 INFO L226 Difference]: Without dead ends: 195228 [2019-09-10 03:59:15,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:59:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195228 states. [2019-09-10 03:59:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195228 to 157921. [2019-09-10 03:59:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157921 states. [2019-09-10 03:59:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157921 states to 157921 states and 246389 transitions. [2019-09-10 03:59:23,831 INFO L78 Accepts]: Start accepts. Automaton has 157921 states and 246389 transitions. Word has length 89 [2019-09-10 03:59:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:59:23,831 INFO L475 AbstractCegarLoop]: Abstraction has 157921 states and 246389 transitions. [2019-09-10 03:59:23,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:59:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 157921 states and 246389 transitions. [2019-09-10 03:59:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:59:23,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:59:23,838 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:59:23,838 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:59:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:59:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash -249952649, now seen corresponding path program 1 times [2019-09-10 03:59:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:59:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:23,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:59:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:23,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:59:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:59:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:59:23,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:59:23,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 03:59:23,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:59:23,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:59:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:59:23,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:59:23,990 INFO L87 Difference]: Start difference. First operand 157921 states and 246389 transitions. Second operand 11 states. [2019-09-10 03:59:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:26,515 INFO L93 Difference]: Finished difference Result 230264 states and 373270 transitions. [2019-09-10 03:59:26,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:59:26,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 03:59:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:27,339 INFO L225 Difference]: With dead ends: 230264 [2019-09-10 03:59:27,340 INFO L226 Difference]: Without dead ends: 230244 [2019-09-10 03:59:27,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:59:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230244 states. [2019-09-10 03:59:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230244 to 156061. [2019-09-10 03:59:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156061 states. [2019-09-10 03:59:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156061 states to 156061 states and 242197 transitions. [2019-09-10 03:59:32,180 INFO L78 Accepts]: Start accepts. Automaton has 156061 states and 242197 transitions. Word has length 89 [2019-09-10 03:59:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:59:32,181 INFO L475 AbstractCegarLoop]: Abstraction has 156061 states and 242197 transitions. [2019-09-10 03:59:32,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:59:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 156061 states and 242197 transitions. [2019-09-10 03:59:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 03:59:32,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:59:32,186 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:59:32,186 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:59:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:59:32,187 INFO L82 PathProgramCache]: Analyzing trace with hash -92550679, now seen corresponding path program 1 times [2019-09-10 03:59:32,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:59:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:32,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:59:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:32,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:59:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:59:32,227 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:59:32,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:59:32,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:59:32,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:59:32,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:59:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:59:32,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:59:32,229 INFO L87 Difference]: Start difference. First operand 156061 states and 242197 transitions. Second operand 3 states. [2019-09-10 03:59:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:33,147 INFO L93 Difference]: Finished difference Result 156157 states and 242315 transitions. [2019-09-10 03:59:33,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:59:33,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 03:59:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:33,794 INFO L225 Difference]: With dead ends: 156157 [2019-09-10 03:59:33,794 INFO L226 Difference]: Without dead ends: 156157 [2019-09-10 03:59:33,795 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:59:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156157 states. [2019-09-10 03:59:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156157 to 156063. [2019-09-10 03:59:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156063 states. [2019-09-10 03:59:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156063 states to 156063 states and 242199 transitions. [2019-09-10 03:59:40,842 INFO L78 Accepts]: Start accepts. Automaton has 156063 states and 242199 transitions. Word has length 90 [2019-09-10 03:59:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:59:40,843 INFO L475 AbstractCegarLoop]: Abstraction has 156063 states and 242199 transitions. [2019-09-10 03:59:40,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:59:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 156063 states and 242199 transitions. [2019-09-10 03:59:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:59:40,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:59:40,850 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:59:40,850 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:59:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:59:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 988708442, now seen corresponding path program 1 times [2019-09-10 03:59:40,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:59:40,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:40,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:59:40,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:40,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:59:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:59:40,950 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:59:40,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:59:40,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:59:40,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:59:40,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:59:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:59:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:59:40,953 INFO L87 Difference]: Start difference. First operand 156063 states and 242199 transitions. Second operand 5 states. [2019-09-10 03:59:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:42,183 INFO L93 Difference]: Finished difference Result 308730 states and 472651 transitions. [2019-09-10 03:59:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:59:42,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 03:59:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:43,079 INFO L225 Difference]: With dead ends: 308730 [2019-09-10 03:59:43,079 INFO L226 Difference]: Without dead ends: 308730 [2019-09-10 03:59:43,079 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:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308730 states. [2019-09-10 03:59:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308730 to 308728. [2019-09-10 03:59:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308728 states. [2019-09-10 03:59:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308728 states to 308728 states and 472650 transitions. [2019-09-10 03:59:52,114 INFO L78 Accepts]: Start accepts. Automaton has 308728 states and 472650 transitions. Word has length 91 [2019-09-10 03:59:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:59:52,114 INFO L475 AbstractCegarLoop]: Abstraction has 308728 states and 472650 transitions. [2019-09-10 03:59:52,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:59:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 308728 states and 472650 transitions. [2019-09-10 03:59:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:59:52,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:59:52,121 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:59:52,121 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:59:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:59:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash -895226652, now seen corresponding path program 1 times [2019-09-10 03:59:52,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:59:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:52,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:59:52,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:52,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:59:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:59:52,216 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:59:52,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:59:52,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:59:52,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:59:52,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:59:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:59:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:59:52,218 INFO L87 Difference]: Start difference. First operand 308728 states and 472650 transitions. Second operand 5 states. [2019-09-10 03:59:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:55,321 INFO L93 Difference]: Finished difference Result 358902 states and 534315 transitions. [2019-09-10 03:59:55,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:59:55,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 03:59:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:56,292 INFO L225 Difference]: With dead ends: 358902 [2019-09-10 03:59:56,293 INFO L226 Difference]: Without dead ends: 358902 [2019-09-10 03:59:56,293 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:59:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358902 states. [2019-09-10 04:00:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358902 to 328204. [2019-09-10 04:00:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328204 states. [2019-09-10 04:00:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328204 states to 328204 states and 483562 transitions. [2019-09-10 04:00:09,411 INFO L78 Accepts]: Start accepts. Automaton has 328204 states and 483562 transitions. Word has length 91 [2019-09-10 04:00:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:00:09,411 INFO L475 AbstractCegarLoop]: Abstraction has 328204 states and 483562 transitions. [2019-09-10 04:00:09,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:00:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 328204 states and 483562 transitions. [2019-09-10 04:00:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 04:00:09,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:00:09,415 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 04:00:09,415 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:00:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:00:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1531600991, now seen corresponding path program 1 times [2019-09-10 04:00:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:00:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:09,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:00:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:09,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:00:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:00:09,516 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:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:00:09,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:00:09,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:00:09,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:00:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:00:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:00:09,520 INFO L87 Difference]: Start difference. First operand 328204 states and 483562 transitions. Second operand 4 states. [2019-09-10 04:00:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:00:10,378 INFO L93 Difference]: Finished difference Result 247905 states and 365835 transitions. [2019-09-10 04:00:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:00:10,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 04:00:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:00:11,041 INFO L225 Difference]: With dead ends: 247905 [2019-09-10 04:00:11,042 INFO L226 Difference]: Without dead ends: 247846 [2019-09-10 04:00:11,042 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 04:00:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247846 states. [2019-09-10 04:00:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247846 to 247846. [2019-09-10 04:00:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247846 states. [2019-09-10 04:00:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247846 states to 247846 states and 365756 transitions. [2019-09-10 04:00:21,156 INFO L78 Accepts]: Start accepts. Automaton has 247846 states and 365756 transitions. Word has length 91 [2019-09-10 04:00:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:00:21,157 INFO L475 AbstractCegarLoop]: Abstraction has 247846 states and 365756 transitions. [2019-09-10 04:00:21,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:00:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 247846 states and 365756 transitions. [2019-09-10 04:00:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:00:21,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:00:21,159 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 04:00:21,159 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:00:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:00:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1434429109, now seen corresponding path program 1 times [2019-09-10 04:00:21,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:00:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:21,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:00:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:21,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:00:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:00:21,253 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:21,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:00:21,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:00:21,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:00:21,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:00:21,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:00:21,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:00:21,255 INFO L87 Difference]: Start difference. First operand 247846 states and 365756 transitions. Second operand 5 states. [2019-09-10 04:00:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:00:23,590 INFO L93 Difference]: Finished difference Result 362889 states and 526815 transitions. [2019-09-10 04:00:23,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:00:23,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 04:00:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:00:24,514 INFO L225 Difference]: With dead ends: 362889 [2019-09-10 04:00:24,515 INFO L226 Difference]: Without dead ends: 362889 [2019-09-10 04:00:24,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:00:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362889 states. [2019-09-10 04:00:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362889 to 334537. [2019-09-10 04:00:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334537 states. [2019-09-10 04:00:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334537 states to 334537 states and 495695 transitions. [2019-09-10 04:00:35,188 INFO L78 Accepts]: Start accepts. Automaton has 334537 states and 495695 transitions. Word has length 93 [2019-09-10 04:00:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:00:35,189 INFO L475 AbstractCegarLoop]: Abstraction has 334537 states and 495695 transitions. [2019-09-10 04:00:35,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:00:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 334537 states and 495695 transitions. [2019-09-10 04:00:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:00:35,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:00:35,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 04:00:35,191 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:00:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:00:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2142671705, now seen corresponding path program 1 times [2019-09-10 04:00:35,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:00:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:00:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:35,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:00:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:00:35,257 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:35,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:00:35,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:00:35,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:00:35,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:00:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:00:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:00:35,259 INFO L87 Difference]: Start difference. First operand 334537 states and 495695 transitions. Second operand 4 states. [2019-09-10 04:00:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:00:38,202 INFO L93 Difference]: Finished difference Result 590869 states and 859061 transitions. [2019-09-10 04:00:38,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:00:38,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 04:00:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:00:41,326 INFO L225 Difference]: With dead ends: 590869 [2019-09-10 04:00:41,326 INFO L226 Difference]: Without dead ends: 590869 [2019-09-10 04:00:41,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:00:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590869 states. [2019-09-10 04:00:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590869 to 590865. [2019-09-10 04:00:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590865 states. [2019-09-10 04:01:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590865 states to 590865 states and 859059 transitions. [2019-09-10 04:01:08,292 INFO L78 Accepts]: Start accepts. Automaton has 590865 states and 859059 transitions. Word has length 93 [2019-09-10 04:01:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:08,293 INFO L475 AbstractCegarLoop]: Abstraction has 590865 states and 859059 transitions. [2019-09-10 04:01:08,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:01:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 590865 states and 859059 transitions. [2019-09-10 04:01:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:01:08,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:08,296 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 04:01:08,296 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1446688205, now seen corresponding path program 1 times [2019-09-10 04:01:08,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:08,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:08,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:08,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:08,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 04:01:08,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:08,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 04:01:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 04:01:08,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:01:08,425 INFO L87 Difference]: Start difference. First operand 590865 states and 859059 transitions. Second operand 10 states. [2019-09-10 04:01:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:13,491 INFO L93 Difference]: Finished difference Result 761640 states and 1116677 transitions. [2019-09-10 04:01:13,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:01:13,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 04:01:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:24,388 INFO L225 Difference]: With dead ends: 761640 [2019-09-10 04:01:24,388 INFO L226 Difference]: Without dead ends: 761592 [2019-09-10 04:01:24,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:01:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761592 states. [2019-09-10 04:01:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761592 to 622119. [2019-09-10 04:01:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622119 states. [2019-09-10 04:01:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622119 states to 622119 states and 905559 transitions. [2019-09-10 04:01:47,636 INFO L78 Accepts]: Start accepts. Automaton has 622119 states and 905559 transitions. Word has length 94 [2019-09-10 04:01:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:47,636 INFO L475 AbstractCegarLoop]: Abstraction has 622119 states and 905559 transitions. [2019-09-10 04:01:47,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 04:01:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 622119 states and 905559 transitions. [2019-09-10 04:01:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:01:47,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:47,639 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 04:01:47,639 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1306139595, now seen corresponding path program 1 times [2019-09-10 04:01:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:47,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:47,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:47,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:47,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:47,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:47,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:01:47,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:47,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:01:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:01:47,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:01:47,757 INFO L87 Difference]: Start difference. First operand 622119 states and 905559 transitions. Second operand 9 states. [2019-09-10 04:01:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:56,334 INFO L93 Difference]: Finished difference Result 817372 states and 1187980 transitions. [2019-09-10 04:01:56,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 04:01:56,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 04:01:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:09,099 INFO L225 Difference]: With dead ends: 817372 [2019-09-10 04:02:09,099 INFO L226 Difference]: Without dead ends: 817372 [2019-09-10 04:02:09,100 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 04:02:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817372 states. [2019-09-10 04:02:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817372 to 673291. [2019-09-10 04:02:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673291 states. [2019-09-10 04:02:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673291 states to 673291 states and 976034 transitions. [2019-09-10 04:02:25,078 INFO L78 Accepts]: Start accepts. Automaton has 673291 states and 976034 transitions. Word has length 94 [2019-09-10 04:02:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:25,078 INFO L475 AbstractCegarLoop]: Abstraction has 673291 states and 976034 transitions. [2019-09-10 04:02:25,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:02:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 673291 states and 976034 transitions. [2019-09-10 04:02:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:02:25,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:25,081 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 04:02:25,081 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:25,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash 896462566, now seen corresponding path program 1 times [2019-09-10 04:02:25,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:25,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:25,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:25,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:25,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:02:25,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:25,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:02:25,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:02:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:02:25,226 INFO L87 Difference]: Start difference. First operand 673291 states and 976034 transitions. Second operand 5 states. [2019-09-10 04:02:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:40,948 INFO L93 Difference]: Finished difference Result 1325045 states and 1896099 transitions. [2019-09-10 04:02:40,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:40,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 04:02:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:46,731 INFO L225 Difference]: With dead ends: 1325045 [2019-09-10 04:02:46,731 INFO L226 Difference]: Without dead ends: 1325045 [2019-09-10 04:02:46,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:02:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325045 states. [2019-09-10 04:03:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325045 to 1325043. [2019-09-10 04:03:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325043 states.