java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:06:02,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:06:02,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:06:02,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:06:02,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:06:02,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:06:02,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:06:02,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:06:02,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:06:02,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:06:02,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:06:02,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:06:02,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:06:02,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:06:02,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:06:02,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:06:02,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:06:02,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:06:02,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:06:02,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:06:02,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:06:02,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:06:02,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:06:02,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:06:02,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:06:02,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:06:02,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:06:02,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:06:02,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:06:02,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:06:02,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:06:02,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:06:02,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:06:02,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:06:02,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:06:02,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:06:02,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:06:02,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:06:02,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:06:02,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:06:02,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:06:02,963 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 09:06:02,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:06:02,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:06:02,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:06:02,995 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:06:02,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:06:02,997 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:06:02,997 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:06:02,998 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:06:02,998 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:06:02,998 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:06:03,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:06:03,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:06:03,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:06:03,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:06:03,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:06:03,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:06:03,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:06:03,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:06:03,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:06:03,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:06:03,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:06:03,003 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:06:03,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:06:03,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:06:03,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:06:03,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:06:03,005 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:06:03,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:06:03,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:06:03,006 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:06:03,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:06:03,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:06:03,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:06:03,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:06:03,087 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:06:03,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 09:06:03,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bfd6dee/60d476adbdf749e898e89089fc262488/FLAG87e09997d [2019-09-10 09:06:03,832 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:06:03,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 09:06:03,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bfd6dee/60d476adbdf749e898e89089fc262488/FLAG87e09997d [2019-09-10 09:06:04,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bfd6dee/60d476adbdf749e898e89089fc262488 [2019-09-10 09:06:04,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:06:04,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:06:04,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:04,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:06:04,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:06:04,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:04" (1/1) ... [2019-09-10 09:06:04,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164487eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:04, skipping insertion in model container [2019-09-10 09:06:04,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:04" (1/1) ... [2019-09-10 09:06:04,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:06:04,160 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:06:04,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:04,958 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:06:05,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:05,519 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:06:05,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05 WrapperNode [2019-09-10 09:06:05,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:05,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:06:05,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:06:05,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:06:05,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (1/1) ... [2019-09-10 09:06:05,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (1/1) ... [2019-09-10 09:06:05,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (1/1) ... [2019-09-10 09:06:05,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (1/1) ... [2019-09-10 09:06:05,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (1/1) ... [2019-09-10 09:06:05,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (1/1) ... [2019-09-10 09:06:05,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (1/1) ... [2019-09-10 09:06:05,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:06:05,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:06:05,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:06:05,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:06:05,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:06:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:06:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:06:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:06:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:06:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:06:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:06:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:06:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:06:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:06:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:06:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:06:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:06:05,814 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:06:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:06:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:06:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:06:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:06:05,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:06:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:06:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:06:08,476 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:06:08,476 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:06:08,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:08 BoogieIcfgContainer [2019-09-10 09:06:08,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:06:08,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:06:08,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:06:08,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:06:08,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:06:04" (1/3) ... [2019-09-10 09:06:08,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4933e45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:08, skipping insertion in model container [2019-09-10 09:06:08,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:05" (2/3) ... [2019-09-10 09:06:08,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4933e45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:08, skipping insertion in model container [2019-09-10 09:06:08,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:08" (3/3) ... [2019-09-10 09:06:08,491 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 09:06:08,500 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:06:08,510 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:06:08,528 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:06:08,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:06:08,560 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:06:08,560 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:06:08,560 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:06:08,560 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:06:08,561 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:06:08,561 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:06:08,561 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:06:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2019-09-10 09:06:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 09:06:08,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:08,641 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1832108402, now seen corresponding path program 1 times [2019-09-10 09:06:08,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:08,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:08,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:08,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:08,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:09,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:09,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:09,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:09,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:09,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:09,572 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2019-09-10 09:06:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:09,777 INFO L93 Difference]: Finished difference Result 984 states and 1761 transitions. [2019-09-10 09:06:09,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:09,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-10 09:06:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:09,814 INFO L225 Difference]: With dead ends: 984 [2019-09-10 09:06:09,815 INFO L226 Difference]: Without dead ends: 976 [2019-09-10 09:06:09,818 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 09:06:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-10 09:06:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-09-10 09:06:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-10 09:06:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1686 transitions. [2019-09-10 09:06:09,954 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1686 transitions. Word has length 217 [2019-09-10 09:06:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:09,960 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1686 transitions. [2019-09-10 09:06:09,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1686 transitions. [2019-09-10 09:06:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 09:06:09,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:09,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:09,971 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash 475136375, now seen corresponding path program 1 times [2019-09-10 09:06:09,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:09,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:10,298 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 09:06:10,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:10,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:10,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:10,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:10,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:10,304 INFO L87 Difference]: Start difference. First operand 974 states and 1686 transitions. Second operand 3 states. [2019-09-10 09:06:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:10,370 INFO L93 Difference]: Finished difference Result 1372 states and 2354 transitions. [2019-09-10 09:06:10,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:10,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-10 09:06:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:10,386 INFO L225 Difference]: With dead ends: 1372 [2019-09-10 09:06:10,386 INFO L226 Difference]: Without dead ends: 1372 [2019-09-10 09:06:10,388 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 09:06:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-09-10 09:06:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2019-09-10 09:06:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2019-09-10 09:06:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2353 transitions. [2019-09-10 09:06:10,453 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2353 transitions. Word has length 221 [2019-09-10 09:06:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:10,456 INFO L475 AbstractCegarLoop]: Abstraction has 1370 states and 2353 transitions. [2019-09-10 09:06:10,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2353 transitions. [2019-09-10 09:06:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 09:06:10,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:10,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:10,469 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash 172719100, now seen corresponding path program 1 times [2019-09-10 09:06:10,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:10,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:10,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:10,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:10,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:10,915 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 09:06:10,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:10,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:10,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:10,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:10,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:10,919 INFO L87 Difference]: Start difference. First operand 1370 states and 2353 transitions. Second operand 3 states. [2019-09-10 09:06:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:10,981 INFO L93 Difference]: Finished difference Result 2140 states and 3642 transitions. [2019-09-10 09:06:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-10 09:06:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:10,996 INFO L225 Difference]: With dead ends: 2140 [2019-09-10 09:06:10,996 INFO L226 Difference]: Without dead ends: 2140 [2019-09-10 09:06:10,997 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 09:06:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-09-10 09:06:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-09-10 09:06:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-09-10 09:06:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3641 transitions. [2019-09-10 09:06:11,058 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3641 transitions. Word has length 225 [2019-09-10 09:06:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:11,059 INFO L475 AbstractCegarLoop]: Abstraction has 2138 states and 3641 transitions. [2019-09-10 09:06:11,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3641 transitions. [2019-09-10 09:06:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 09:06:11,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:11,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:11,067 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash 300878849, now seen corresponding path program 1 times [2019-09-10 09:06:11,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:11,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:11,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:11,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:11,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:11,393 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 09:06:11,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:11,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:11,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:11,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:11,396 INFO L87 Difference]: Start difference. First operand 2138 states and 3641 transitions. Second operand 3 states. [2019-09-10 09:06:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:11,460 INFO L93 Difference]: Finished difference Result 3628 states and 6126 transitions. [2019-09-10 09:06:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:11,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 09:06:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:11,480 INFO L225 Difference]: With dead ends: 3628 [2019-09-10 09:06:11,481 INFO L226 Difference]: Without dead ends: 3628 [2019-09-10 09:06:11,481 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 09:06:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-09-10 09:06:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3626. [2019-09-10 09:06:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3626 states. [2019-09-10 09:06:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 6125 transitions. [2019-09-10 09:06:11,578 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 6125 transitions. Word has length 229 [2019-09-10 09:06:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:11,579 INFO L475 AbstractCegarLoop]: Abstraction has 3626 states and 6125 transitions. [2019-09-10 09:06:11,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 6125 transitions. [2019-09-10 09:06:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 09:06:11,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:11,586 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:11,586 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash 7408774, now seen corresponding path program 1 times [2019-09-10 09:06:11,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:11,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:11,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:11,818 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 09:06:11,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:11,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:11,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:11,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:11,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:11,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:11,822 INFO L87 Difference]: Start difference. First operand 3626 states and 6125 transitions. Second operand 3 states. [2019-09-10 09:06:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:11,907 INFO L93 Difference]: Finished difference Result 6508 states and 10910 transitions. [2019-09-10 09:06:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:11,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-10 09:06:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:11,954 INFO L225 Difference]: With dead ends: 6508 [2019-09-10 09:06:11,954 INFO L226 Difference]: Without dead ends: 6508 [2019-09-10 09:06:11,954 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 09:06:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2019-09-10 09:06:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6506. [2019-09-10 09:06:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-09-10 09:06:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10909 transitions. [2019-09-10 09:06:12,234 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10909 transitions. Word has length 233 [2019-09-10 09:06:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:12,234 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 10909 transitions. [2019-09-10 09:06:12,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10909 transitions. [2019-09-10 09:06:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 09:06:12,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:12,245 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:12,245 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:12,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1561634677, now seen corresponding path program 1 times [2019-09-10 09:06:12,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:12,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:12,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:12,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:12,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:12,751 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 09:06:12,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:12,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:06:12,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:12,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:06:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:06:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:06:12,753 INFO L87 Difference]: Start difference. First operand 6506 states and 10909 transitions. Second operand 7 states. [2019-09-10 09:06:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:13,768 INFO L93 Difference]: Finished difference Result 33759 states and 56628 transitions. [2019-09-10 09:06:13,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 09:06:13,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2019-09-10 09:06:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:13,900 INFO L225 Difference]: With dead ends: 33759 [2019-09-10 09:06:13,901 INFO L226 Difference]: Without dead ends: 33759 [2019-09-10 09:06:13,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 09:06:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33759 states. [2019-09-10 09:06:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33759 to 12303. [2019-09-10 09:06:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-09-10 09:06:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 20548 transitions. [2019-09-10 09:06:14,505 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 20548 transitions. Word has length 237 [2019-09-10 09:06:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:14,507 INFO L475 AbstractCegarLoop]: Abstraction has 12303 states and 20548 transitions. [2019-09-10 09:06:14,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:06:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 20548 transitions. [2019-09-10 09:06:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 09:06:14,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:14,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:14,526 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:14,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:14,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1236760728, now seen corresponding path program 1 times [2019-09-10 09:06:14,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:14,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:14,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:14,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:14,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:14,779 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 09:06:14,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:14,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:06:14,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:14,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:06:14,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:06:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:14,782 INFO L87 Difference]: Start difference. First operand 12303 states and 20548 transitions. Second operand 4 states. [2019-09-10 09:06:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:15,001 INFO L93 Difference]: Finished difference Result 21233 states and 35544 transitions. [2019-09-10 09:06:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:06:15,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-10 09:06:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:15,154 INFO L225 Difference]: With dead ends: 21233 [2019-09-10 09:06:15,155 INFO L226 Difference]: Without dead ends: 21233 [2019-09-10 09:06:15,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:06:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21233 states. [2019-09-10 09:06:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21233 to 18279. [2019-09-10 09:06:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-09-10 09:06:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 30544 transitions. [2019-09-10 09:06:15,484 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 30544 transitions. Word has length 238 [2019-09-10 09:06:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:15,484 INFO L475 AbstractCegarLoop]: Abstraction has 18279 states and 30544 transitions. [2019-09-10 09:06:15,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 30544 transitions. [2019-09-10 09:06:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:06:15,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:15,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:15,499 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash -626801516, now seen corresponding path program 1 times [2019-09-10 09:06:15,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:15,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:15,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:15,688 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 09:06:15,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:15,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:15,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:15,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:15,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:15,690 INFO L87 Difference]: Start difference. First operand 18279 states and 30544 transitions. Second operand 3 states. [2019-09-10 09:06:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:15,825 INFO L93 Difference]: Finished difference Result 28072 states and 46878 transitions. [2019-09-10 09:06:15,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:15,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:06:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:15,903 INFO L225 Difference]: With dead ends: 28072 [2019-09-10 09:06:15,904 INFO L226 Difference]: Without dead ends: 28072 [2019-09-10 09:06:15,904 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 09:06:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28072 states. [2019-09-10 09:06:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28072 to 28070. [2019-09-10 09:06:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28070 states. [2019-09-10 09:06:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28070 states to 28070 states and 46877 transitions. [2019-09-10 09:06:17,265 INFO L78 Accepts]: Start accepts. Automaton has 28070 states and 46877 transitions. Word has length 239 [2019-09-10 09:06:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:17,266 INFO L475 AbstractCegarLoop]: Abstraction has 28070 states and 46877 transitions. [2019-09-10 09:06:17,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 28070 states and 46877 transitions. [2019-09-10 09:06:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:06:17,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:17,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:17,279 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1621339669, now seen corresponding path program 1 times [2019-09-10 09:06:17,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:17,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:17,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:17,476 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 09:06:17,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:17,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:17,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:17,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:17,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:17,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:17,478 INFO L87 Difference]: Start difference. First operand 28070 states and 46877 transitions. Second operand 3 states. [2019-09-10 09:06:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:17,618 INFO L93 Difference]: Finished difference Result 39524 states and 65882 transitions. [2019-09-10 09:06:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:17,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:06:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:17,705 INFO L225 Difference]: With dead ends: 39524 [2019-09-10 09:06:17,706 INFO L226 Difference]: Without dead ends: 39524 [2019-09-10 09:06:17,707 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 09:06:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39524 states. [2019-09-10 09:06:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39524 to 39522. [2019-09-10 09:06:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-09-10 09:06:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 65881 transitions. [2019-09-10 09:06:19,212 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 65881 transitions. Word has length 239 [2019-09-10 09:06:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:19,212 INFO L475 AbstractCegarLoop]: Abstraction has 39522 states and 65881 transitions. [2019-09-10 09:06:19,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 65881 transitions. [2019-09-10 09:06:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:06:19,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:19,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:19,222 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash -839265151, now seen corresponding path program 1 times [2019-09-10 09:06:19,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:19,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:19,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:19,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:19,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:19,447 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 09:06:19,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:19,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:19,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:19,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:19,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:19,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:19,449 INFO L87 Difference]: Start difference. First operand 39522 states and 65881 transitions. Second operand 3 states. [2019-09-10 09:06:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:19,636 INFO L93 Difference]: Finished difference Result 55408 states and 92186 transitions. [2019-09-10 09:06:19,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:19,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:06:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:19,751 INFO L225 Difference]: With dead ends: 55408 [2019-09-10 09:06:19,751 INFO L226 Difference]: Without dead ends: 55408 [2019-09-10 09:06:19,752 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 09:06:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55408 states. [2019-09-10 09:06:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55408 to 55406. [2019-09-10 09:06:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55406 states. [2019-09-10 09:06:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55406 states to 55406 states and 92185 transitions. [2019-09-10 09:06:20,671 INFO L78 Accepts]: Start accepts. Automaton has 55406 states and 92185 transitions. Word has length 239 [2019-09-10 09:06:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:20,672 INFO L475 AbstractCegarLoop]: Abstraction has 55406 states and 92185 transitions. [2019-09-10 09:06:20,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 55406 states and 92185 transitions. [2019-09-10 09:06:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:06:20,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:20,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:20,677 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:20,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1472495767, now seen corresponding path program 1 times [2019-09-10 09:06:20,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:20,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:20,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:20,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:20,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:21,154 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 09:06:21,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:21,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:21,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:21,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:21,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:21,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:21,159 INFO L87 Difference]: Start difference. First operand 55406 states and 92185 transitions. Second operand 3 states. [2019-09-10 09:06:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:21,470 INFO L93 Difference]: Finished difference Result 77300 states and 128350 transitions. [2019-09-10 09:06:21,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:21,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:06:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:21,608 INFO L225 Difference]: With dead ends: 77300 [2019-09-10 09:06:21,608 INFO L226 Difference]: Without dead ends: 77300 [2019-09-10 09:06:21,610 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 09:06:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77300 states. [2019-09-10 09:06:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77300 to 77298. [2019-09-10 09:06:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77298 states. [2019-09-10 09:06:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77298 states to 77298 states and 128349 transitions. [2019-09-10 09:06:24,341 INFO L78 Accepts]: Start accepts. Automaton has 77298 states and 128349 transitions. Word has length 239 [2019-09-10 09:06:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:24,342 INFO L475 AbstractCegarLoop]: Abstraction has 77298 states and 128349 transitions. [2019-09-10 09:06:24,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 77298 states and 128349 transitions. [2019-09-10 09:06:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:06:24,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:24,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:24,347 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash 141121069, now seen corresponding path program 1 times [2019-09-10 09:06:24,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:24,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:24,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:24,575 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 09:06:24,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:24,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:24,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:24,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:24,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:24,580 INFO L87 Difference]: Start difference. First operand 77298 states and 128349 transitions. Second operand 3 states. [2019-09-10 09:06:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:24,948 INFO L93 Difference]: Finished difference Result 107244 states and 177669 transitions. [2019-09-10 09:06:24,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:24,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:06:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:25,137 INFO L225 Difference]: With dead ends: 107244 [2019-09-10 09:06:25,138 INFO L226 Difference]: Without dead ends: 107244 [2019-09-10 09:06:25,139 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 09:06:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107244 states. [2019-09-10 09:06:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107244 to 107242. [2019-09-10 09:06:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107242 states. [2019-09-10 09:06:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107242 states to 107242 states and 177668 transitions. [2019-09-10 09:06:26,683 INFO L78 Accepts]: Start accepts. Automaton has 107242 states and 177668 transitions. Word has length 239 [2019-09-10 09:06:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:26,683 INFO L475 AbstractCegarLoop]: Abstraction has 107242 states and 177668 transitions. [2019-09-10 09:06:26,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 107242 states and 177668 transitions. [2019-09-10 09:06:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:06:26,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:26,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:26,688 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash 248955122, now seen corresponding path program 1 times [2019-09-10 09:06:26,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:26,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:26,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:26,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:26,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:26,891 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 09:06:26,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:26,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:06:26,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:26,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:06:26,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:06:26,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:26,894 INFO L87 Difference]: Start difference. First operand 107242 states and 177668 transitions. Second operand 4 states. [2019-09-10 09:06:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:29,993 INFO L93 Difference]: Finished difference Result 210652 states and 348835 transitions. [2019-09-10 09:06:29,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:06:29,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-10 09:06:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:30,283 INFO L225 Difference]: With dead ends: 210652 [2019-09-10 09:06:30,283 INFO L226 Difference]: Without dead ends: 210652 [2019-09-10 09:06:30,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:06:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210652 states. [2019-09-10 09:06:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210652 to 176201. [2019-09-10 09:06:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176201 states. [2019-09-10 09:06:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176201 states to 176201 states and 291287 transitions. [2019-09-10 09:06:32,114 INFO L78 Accepts]: Start accepts. Automaton has 176201 states and 291287 transitions. Word has length 239 [2019-09-10 09:06:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:32,115 INFO L475 AbstractCegarLoop]: Abstraction has 176201 states and 291287 transitions. [2019-09-10 09:06:32,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 176201 states and 291287 transitions. [2019-09-10 09:06:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 09:06:32,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:32,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:32,120 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:32,120 INFO L82 PathProgramCache]: Analyzing trace with hash -933935761, now seen corresponding path program 1 times [2019-09-10 09:06:32,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:32,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:32,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:32,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:32,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:32,930 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 09:06:32,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:32,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:06:32,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:32,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:06:32,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:06:32,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:32,933 INFO L87 Difference]: Start difference. First operand 176201 states and 291287 transitions. Second operand 4 states. [2019-09-10 09:06:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:33,686 INFO L93 Difference]: Finished difference Result 347397 states and 574048 transitions. [2019-09-10 09:06:33,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:06:33,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 09:06:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:34,161 INFO L225 Difference]: With dead ends: 347397 [2019-09-10 09:06:34,161 INFO L226 Difference]: Without dead ends: 347397 [2019-09-10 09:06:34,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347397 states. [2019-09-10 09:06:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347397 to 289052. [2019-09-10 09:06:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289052 states. [2019-09-10 09:06:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289052 states to 289052 states and 476834 transitions. [2019-09-10 09:06:40,913 INFO L78 Accepts]: Start accepts. Automaton has 289052 states and 476834 transitions. Word has length 240 [2019-09-10 09:06:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:40,913 INFO L475 AbstractCegarLoop]: Abstraction has 289052 states and 476834 transitions. [2019-09-10 09:06:40,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 289052 states and 476834 transitions. [2019-09-10 09:06:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:06:40,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:40,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:40,918 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:40,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:40,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1055710553, now seen corresponding path program 1 times [2019-09-10 09:06:40,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:40,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:40,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:40,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:44,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:44,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:06:44,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:44,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:06:44,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:06:44,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:44,827 INFO L87 Difference]: Start difference. First operand 289052 states and 476834 transitions. Second operand 4 states. [2019-09-10 09:06:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:46,095 INFO L93 Difference]: Finished difference Result 561498 states and 926029 transitions. [2019-09-10 09:06:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:06:46,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-10 09:06:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:46,950 INFO L225 Difference]: With dead ends: 561498 [2019-09-10 09:06:46,950 INFO L226 Difference]: Without dead ends: 561498 [2019-09-10 09:06:46,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:06:47,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561498 states. [2019-09-10 09:06:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561498 to 472375. [2019-09-10 09:06:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472375 states. [2019-09-10 09:06:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472375 states to 472375 states and 777625 transitions. [2019-09-10 09:06:58,835 INFO L78 Accepts]: Start accepts. Automaton has 472375 states and 777625 transitions. Word has length 241 [2019-09-10 09:06:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:58,836 INFO L475 AbstractCegarLoop]: Abstraction has 472375 states and 777625 transitions. [2019-09-10 09:06:58,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 472375 states and 777625 transitions. [2019-09-10 09:06:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 09:06:58,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:58,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:58,840 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1685205130, now seen corresponding path program 1 times [2019-09-10 09:06:58,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:58,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:58,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:05,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:05,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:07:05,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:05,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:07:05,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:07:05,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:07:05,166 INFO L87 Difference]: Start difference. First operand 472375 states and 777625 transitions. Second operand 8 states. [2019-09-10 09:07:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:13,821 INFO L93 Difference]: Finished difference Result 2141251 states and 3523685 transitions. [2019-09-10 09:07:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 09:07:13,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-10 09:07:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:17,183 INFO L225 Difference]: With dead ends: 2141251 [2019-09-10 09:07:17,184 INFO L226 Difference]: Without dead ends: 2141251 [2019-09-10 09:07:17,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 09:07:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141251 states. [2019-09-10 09:08:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141251 to 1298082. [2019-09-10 09:08:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298082 states. [2019-09-10 09:08:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298082 states to 1298082 states and 2128136 transitions. [2019-09-10 09:08:20,291 INFO L78 Accepts]: Start accepts. Automaton has 1298082 states and 2128136 transitions. Word has length 242 [2019-09-10 09:08:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:20,291 INFO L475 AbstractCegarLoop]: Abstraction has 1298082 states and 2128136 transitions. [2019-09-10 09:08:20,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:08:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1298082 states and 2128136 transitions. [2019-09-10 09:08:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 09:08:20,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:20,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:20,294 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1769078554, now seen corresponding path program 1 times [2019-09-10 09:08:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:20,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:20,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:20,920 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 09:08:20,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:20,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:08:20,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:20,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:08:20,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:08:20,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:08:20,923 INFO L87 Difference]: Start difference. First operand 1298082 states and 2128136 transitions. Second operand 7 states. [2019-09-10 09:08:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:37,127 INFO L93 Difference]: Finished difference Result 1842686 states and 3023033 transitions. [2019-09-10 09:08:37,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:08:37,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2019-09-10 09:08:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:51,845 INFO L225 Difference]: With dead ends: 1842686 [2019-09-10 09:08:51,845 INFO L226 Difference]: Without dead ends: 1842686 [2019-09-10 09:08:51,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:08:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842686 states. [2019-09-10 09:09:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842686 to 1298082. [2019-09-10 09:09:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298082 states.