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_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:33:31,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:33:31,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:33:31,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:33:31,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:33:31,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:33:31,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:33:31,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:33:31,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:33:31,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:33:31,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:33:31,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:33:31,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:33:31,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:33:31,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:33:31,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:33:31,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:33:31,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:33:31,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:33:31,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:33:31,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:33:31,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:33:31,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:33:31,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:33:31,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:33:31,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:33:31,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:33:31,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:33:31,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:33:31,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:33:31,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:33:31,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:33:31,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:33:31,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:33:31,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:33:31,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:33:31,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:33:31,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:33:31,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:33:31,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:33:31,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:33:31,753 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 06:33:31,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:33:31,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:33:31,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:33:31,784 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:33:31,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:33:31,785 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:33:31,786 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:33:31,786 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:33:31,786 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:33:31,786 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:33:31,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:33:31,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:33:31,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:33:31,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:33:31,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:33:31,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:33:31,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:33:31,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:33:31,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:33:31,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:33:31,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:33:31,792 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:33:31,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:33:31,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:33:31,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:33:31,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:33:31,793 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:33:31,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:33:31,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:33:31,794 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:33:31,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:33:31,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:33:31,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:33:31,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:33:31,861 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:33:31,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:33:31,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a636ef7fc/e1ddad0313654badadd55cbdcf74b5b1/FLAGcf738c90b [2019-09-10 06:33:32,613 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:33:32,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:33:32,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a636ef7fc/e1ddad0313654badadd55cbdcf74b5b1/FLAGcf738c90b [2019-09-10 06:33:32,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a636ef7fc/e1ddad0313654badadd55cbdcf74b5b1 [2019-09-10 06:33:32,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:33:32,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:33:32,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:33:32,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:33:32,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:33:32,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:33:32" (1/1) ... [2019-09-10 06:33:32,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4089cffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:32, skipping insertion in model container [2019-09-10 06:33:32,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:33:32" (1/1) ... [2019-09-10 06:33:32,789 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:33:32,893 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:33:33,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:33:33,675 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:33:33,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:33:34,031 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:33:34,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34 WrapperNode [2019-09-10 06:33:34,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:33:34,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:33:34,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:33:34,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:33:34,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (1/1) ... [2019-09-10 06:33:34,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (1/1) ... [2019-09-10 06:33:34,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (1/1) ... [2019-09-10 06:33:34,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (1/1) ... [2019-09-10 06:33:34,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (1/1) ... [2019-09-10 06:33:34,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (1/1) ... [2019-09-10 06:33:34,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (1/1) ... [2019-09-10 06:33:34,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:33:34,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:33:34,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:33:34,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:33:34,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (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 06:33:34,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:33:34,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:33:34,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:33:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:33:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:33:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:33:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:33:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:33:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:33:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:33:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:33:34,342 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:33:34,342 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:33:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:33:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:33:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:33:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:33:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:33:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:33:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:33:36,914 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:33:36,914 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:33:36,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:33:36 BoogieIcfgContainer [2019-09-10 06:33:36,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:33:36,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:33:36,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:33:36,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:33:36,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:33:32" (1/3) ... [2019-09-10 06:33:36,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409972ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:33:36, skipping insertion in model container [2019-09-10 06:33:36,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:34" (2/3) ... [2019-09-10 06:33:36,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409972ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:33:36, skipping insertion in model container [2019-09-10 06:33:36,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:33:36" (3/3) ... [2019-09-10 06:33:36,926 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:33:36,936 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:33:36,962 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:33:36,984 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:33:37,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:33:37,017 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:33:37,017 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:33:37,017 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:33:37,017 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:33:37,017 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:33:37,018 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:33:37,018 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:33:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-10 06:33:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 06:33:37,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:37,117 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] [2019-09-10 06:33:37,119 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:37,123 INFO L82 PathProgramCache]: Analyzing trace with hash 326812692, now seen corresponding path program 1 times [2019-09-10 06:33:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:37,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:37,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:37,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:37,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:37,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 06:33:37,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:37,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:37,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:37,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:37,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:37,944 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 3 states. [2019-09-10 06:33:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:38,114 INFO L93 Difference]: Finished difference Result 922 states and 1654 transitions. [2019-09-10 06:33:38,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:38,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 06:33:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:38,154 INFO L225 Difference]: With dead ends: 922 [2019-09-10 06:33:38,155 INFO L226 Difference]: Without dead ends: 914 [2019-09-10 06:33:38,158 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 06:33:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-10 06:33:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2019-09-10 06:33:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-10 06:33:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1584 transitions. [2019-09-10 06:33:38,260 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1584 transitions. Word has length 208 [2019-09-10 06:33:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:38,261 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1584 transitions. [2019-09-10 06:33:38,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1584 transitions. [2019-09-10 06:33:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 06:33:38,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:38,267 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] [2019-09-10 06:33:38,268 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:38,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:38,268 INFO L82 PathProgramCache]: Analyzing trace with hash -749134671, now seen corresponding path program 1 times [2019-09-10 06:33:38,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:38,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:38,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:38,494 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 06:33:38,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:38,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:38,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:38,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:38,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:38,497 INFO L87 Difference]: Start difference. First operand 912 states and 1584 transitions. Second operand 3 states. [2019-09-10 06:33:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:38,565 INFO L93 Difference]: Finished difference Result 1255 states and 2157 transitions. [2019-09-10 06:33:38,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:38,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 06:33:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:38,577 INFO L225 Difference]: With dead ends: 1255 [2019-09-10 06:33:38,578 INFO L226 Difference]: Without dead ends: 1255 [2019-09-10 06:33:38,579 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 06:33:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-09-10 06:33:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2019-09-10 06:33:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-09-10 06:33:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2156 transitions. [2019-09-10 06:33:38,625 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2156 transitions. Word has length 212 [2019-09-10 06:33:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:38,626 INFO L475 AbstractCegarLoop]: Abstraction has 1253 states and 2156 transitions. [2019-09-10 06:33:38,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2156 transitions. [2019-09-10 06:33:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 06:33:38,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:38,635 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] [2019-09-10 06:33:38,635 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:38,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1492476271, now seen corresponding path program 1 times [2019-09-10 06:33:38,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:38,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:38,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:38,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:38,981 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 06:33:38,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:38,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:38,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:38,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:38,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:38,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:38,985 INFO L87 Difference]: Start difference. First operand 1253 states and 2156 transitions. Second operand 3 states. [2019-09-10 06:33:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:39,038 INFO L93 Difference]: Finished difference Result 1589 states and 2719 transitions. [2019-09-10 06:33:39,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:39,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 06:33:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:39,056 INFO L225 Difference]: With dead ends: 1589 [2019-09-10 06:33:39,057 INFO L226 Difference]: Without dead ends: 1589 [2019-09-10 06:33:39,057 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 06:33:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-09-10 06:33:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1587. [2019-09-10 06:33:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-09-10 06:33:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2718 transitions. [2019-09-10 06:33:39,102 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2718 transitions. Word has length 216 [2019-09-10 06:33:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:39,103 INFO L475 AbstractCegarLoop]: Abstraction has 1587 states and 2718 transitions. [2019-09-10 06:33:39,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2718 transitions. [2019-09-10 06:33:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 06:33:39,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:39,108 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] [2019-09-10 06:33:39,108 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2071522764, now seen corresponding path program 1 times [2019-09-10 06:33:39,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:39,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:39,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:39,450 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 06:33:39,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:39,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:39,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:39,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:39,452 INFO L87 Difference]: Start difference. First operand 1587 states and 2718 transitions. Second operand 3 states. [2019-09-10 06:33:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:39,502 INFO L93 Difference]: Finished difference Result 2524 states and 4277 transitions. [2019-09-10 06:33:39,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:39,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 06:33:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:39,516 INFO L225 Difference]: With dead ends: 2524 [2019-09-10 06:33:39,516 INFO L226 Difference]: Without dead ends: 2524 [2019-09-10 06:33:39,517 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 06:33:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-10 06:33:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2522. [2019-09-10 06:33:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2019-09-10 06:33:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4276 transitions. [2019-09-10 06:33:39,599 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4276 transitions. Word has length 216 [2019-09-10 06:33:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:39,599 INFO L475 AbstractCegarLoop]: Abstraction has 2522 states and 4276 transitions. [2019-09-10 06:33:39,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4276 transitions. [2019-09-10 06:33:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 06:33:39,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:39,605 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] [2019-09-10 06:33:39,605 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:39,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:39,606 INFO L82 PathProgramCache]: Analyzing trace with hash -108508146, now seen corresponding path program 1 times [2019-09-10 06:33:39,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:39,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:39,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:39,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:39,792 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 06:33:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:39,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:39,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:39,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:39,794 INFO L87 Difference]: Start difference. First operand 2522 states and 4276 transitions. Second operand 3 states. [2019-09-10 06:33:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:39,909 INFO L93 Difference]: Finished difference Result 3373 states and 5695 transitions. [2019-09-10 06:33:39,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:39,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-10 06:33:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:39,931 INFO L225 Difference]: With dead ends: 3373 [2019-09-10 06:33:39,931 INFO L226 Difference]: Without dead ends: 3373 [2019-09-10 06:33:39,932 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 06:33:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2019-09-10 06:33:40,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3371. [2019-09-10 06:33:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2019-09-10 06:33:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 5694 transitions. [2019-09-10 06:33:40,031 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 5694 transitions. Word has length 220 [2019-09-10 06:33:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:40,032 INFO L475 AbstractCegarLoop]: Abstraction has 3371 states and 5694 transitions. [2019-09-10 06:33:40,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:40,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 5694 transitions. [2019-09-10 06:33:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 06:33:40,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:40,037 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] [2019-09-10 06:33:40,038 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 959349905, now seen corresponding path program 1 times [2019-09-10 06:33:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:40,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:40,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:40,287 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 06:33:40,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:40,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:40,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:40,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:40,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:40,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:40,290 INFO L87 Difference]: Start difference. First operand 3371 states and 5694 transitions. Second operand 3 states. [2019-09-10 06:33:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:40,364 INFO L93 Difference]: Finished difference Result 5914 states and 9895 transitions. [2019-09-10 06:33:40,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:40,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-10 06:33:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:40,396 INFO L225 Difference]: With dead ends: 5914 [2019-09-10 06:33:40,397 INFO L226 Difference]: Without dead ends: 5914 [2019-09-10 06:33:40,397 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 06:33:40,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-09-10 06:33:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 5912. [2019-09-10 06:33:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-09-10 06:33:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 9894 transitions. [2019-09-10 06:33:40,589 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 9894 transitions. Word has length 220 [2019-09-10 06:33:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:40,590 INFO L475 AbstractCegarLoop]: Abstraction has 5912 states and 9894 transitions. [2019-09-10 06:33:40,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 9894 transitions. [2019-09-10 06:33:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 06:33:40,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:40,607 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] [2019-09-10 06:33:40,607 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash 792658975, now seen corresponding path program 1 times [2019-09-10 06:33:40,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:40,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:40,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:40,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:40,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:41,091 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 06:33:41,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:41,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:41,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:41,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:41,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:41,097 INFO L87 Difference]: Start difference. First operand 5912 states and 9894 transitions. Second operand 3 states. [2019-09-10 06:33:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:41,177 INFO L93 Difference]: Finished difference Result 8105 states and 13535 transitions. [2019-09-10 06:33:41,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:41,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 06:33:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:41,245 INFO L225 Difference]: With dead ends: 8105 [2019-09-10 06:33:41,245 INFO L226 Difference]: Without dead ends: 8105 [2019-09-10 06:33:41,246 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 06:33:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8105 states. [2019-09-10 06:33:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8105 to 8103. [2019-09-10 06:33:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8103 states. [2019-09-10 06:33:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13534 transitions. [2019-09-10 06:33:41,463 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13534 transitions. Word has length 224 [2019-09-10 06:33:41,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:41,463 INFO L475 AbstractCegarLoop]: Abstraction has 8103 states and 13534 transitions. [2019-09-10 06:33:41,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13534 transitions. [2019-09-10 06:33:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 06:33:41,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:41,469 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] [2019-09-10 06:33:41,469 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1043249236, now seen corresponding path program 1 times [2019-09-10 06:33:41,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:41,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:41,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:41,721 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 06:33:41,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:41,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:41,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:41,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:41,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:41,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:41,724 INFO L87 Difference]: Start difference. First operand 8103 states and 13534 transitions. Second operand 3 states. [2019-09-10 06:33:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:41,826 INFO L93 Difference]: Finished difference Result 14936 states and 24713 transitions. [2019-09-10 06:33:41,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:41,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 06:33:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:41,962 INFO L225 Difference]: With dead ends: 14936 [2019-09-10 06:33:41,962 INFO L226 Difference]: Without dead ends: 14936 [2019-09-10 06:33:41,963 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 06:33:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14936 states. [2019-09-10 06:33:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14936 to 14934. [2019-09-10 06:33:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14934 states. [2019-09-10 06:33:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14934 states to 14934 states and 24712 transitions. [2019-09-10 06:33:42,272 INFO L78 Accepts]: Start accepts. Automaton has 14934 states and 24712 transitions. Word has length 224 [2019-09-10 06:33:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:42,273 INFO L475 AbstractCegarLoop]: Abstraction has 14934 states and 24712 transitions. [2019-09-10 06:33:42,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 14934 states and 24712 transitions. [2019-09-10 06:33:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 06:33:42,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:42,280 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] [2019-09-10 06:33:42,281 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1254462577, now seen corresponding path program 1 times [2019-09-10 06:33:42,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:42,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:42,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:42,762 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 06:33:42,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:42,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:33:42,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:42,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:33:42,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:33:42,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:33:42,764 INFO L87 Difference]: Start difference. First operand 14934 states and 24712 transitions. Second operand 7 states. [2019-09-10 06:33:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:43,873 INFO L93 Difference]: Finished difference Result 90509 states and 150293 transitions. [2019-09-10 06:33:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:33:43,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-09-10 06:33:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:44,138 INFO L225 Difference]: With dead ends: 90509 [2019-09-10 06:33:44,138 INFO L226 Difference]: Without dead ends: 90509 [2019-09-10 06:33:44,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:33:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90509 states. [2019-09-10 06:33:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90509 to 29107. [2019-09-10 06:33:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29107 states. [2019-09-10 06:33:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29107 states to 29107 states and 47961 transitions. [2019-09-10 06:33:46,302 INFO L78 Accepts]: Start accepts. Automaton has 29107 states and 47961 transitions. Word has length 228 [2019-09-10 06:33:46,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:46,303 INFO L475 AbstractCegarLoop]: Abstraction has 29107 states and 47961 transitions. [2019-09-10 06:33:46,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:33:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 29107 states and 47961 transitions. [2019-09-10 06:33:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:33:46,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:46,308 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 06:33:46,309 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash 162908202, now seen corresponding path program 1 times [2019-09-10 06:33:46,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:46,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:46,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:46,550 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 06:33:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:46,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:46,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:46,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:46,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:46,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:46,553 INFO L87 Difference]: Start difference. First operand 29107 states and 47961 transitions. Second operand 4 states. [2019-09-10 06:33:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:46,832 INFO L93 Difference]: Finished difference Result 51308 states and 84989 transitions. [2019-09-10 06:33:46,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:33:46,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-10 06:33:46,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:46,987 INFO L225 Difference]: With dead ends: 51308 [2019-09-10 06:33:46,987 INFO L226 Difference]: Without dead ends: 51308 [2019-09-10 06:33:46,988 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 06:33:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51308 states. [2019-09-10 06:33:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51308 to 43862. [2019-09-10 06:33:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43862 states. [2019-09-10 06:33:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43862 states to 43862 states and 72426 transitions. [2019-09-10 06:33:48,150 INFO L78 Accepts]: Start accepts. Automaton has 43862 states and 72426 transitions. Word has length 229 [2019-09-10 06:33:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:48,151 INFO L475 AbstractCegarLoop]: Abstraction has 43862 states and 72426 transitions. [2019-09-10 06:33:48,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:33:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 43862 states and 72426 transitions. [2019-09-10 06:33:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:33:48,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:48,157 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:48,157 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1006966476, now seen corresponding path program 1 times [2019-09-10 06:33:48,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:48,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:48,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:48,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:48,438 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 06:33:48,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:48,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:48,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:48,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:48,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:48,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:48,441 INFO L87 Difference]: Start difference. First operand 43862 states and 72426 transitions. Second operand 3 states. [2019-09-10 06:33:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:48,730 INFO L93 Difference]: Finished difference Result 61182 states and 100890 transitions. [2019-09-10 06:33:48,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:48,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 06:33:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:50,008 INFO L225 Difference]: With dead ends: 61182 [2019-09-10 06:33:50,009 INFO L226 Difference]: Without dead ends: 61182 [2019-09-10 06:33:50,010 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 06:33:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61182 states. [2019-09-10 06:33:50,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61182 to 61180. [2019-09-10 06:33:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61180 states. [2019-09-10 06:33:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61180 states to 61180 states and 100889 transitions. [2019-09-10 06:33:50,838 INFO L78 Accepts]: Start accepts. Automaton has 61180 states and 100889 transitions. Word has length 229 [2019-09-10 06:33:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:50,839 INFO L475 AbstractCegarLoop]: Abstraction has 61180 states and 100889 transitions. [2019-09-10 06:33:50,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 61180 states and 100889 transitions. [2019-09-10 06:33:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:33:50,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:50,844 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 06:33:50,845 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash 133298612, now seen corresponding path program 1 times [2019-09-10 06:33:50,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:50,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:50,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:50,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:50,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:51,047 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 06:33:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:51,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:51,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:51,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:51,049 INFO L87 Difference]: Start difference. First operand 61180 states and 100889 transitions. Second operand 3 states. [2019-09-10 06:33:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:51,681 INFO L93 Difference]: Finished difference Result 92060 states and 151941 transitions. [2019-09-10 06:33:51,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:51,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 06:33:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:51,833 INFO L225 Difference]: With dead ends: 92060 [2019-09-10 06:33:51,834 INFO L226 Difference]: Without dead ends: 92060 [2019-09-10 06:33:51,834 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 06:33:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92060 states. [2019-09-10 06:33:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92060 to 92058. [2019-09-10 06:33:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92058 states. [2019-09-10 06:33:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92058 states to 92058 states and 151940 transitions. [2019-09-10 06:33:55,151 INFO L78 Accepts]: Start accepts. Automaton has 92058 states and 151940 transitions. Word has length 229 [2019-09-10 06:33:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:55,152 INFO L475 AbstractCegarLoop]: Abstraction has 92058 states and 151940 transitions. [2019-09-10 06:33:55,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 92058 states and 151940 transitions. [2019-09-10 06:33:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:33:55,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:55,157 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:55,157 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:55,157 INFO L82 PathProgramCache]: Analyzing trace with hash 689018968, now seen corresponding path program 1 times [2019-09-10 06:33:55,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:55,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:55,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:55,376 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 06:33:55,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:55,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:55,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:55,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:55,378 INFO L87 Difference]: Start difference. First operand 92058 states and 151940 transitions. Second operand 4 states. [2019-09-10 06:33:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:56,128 INFO L93 Difference]: Finished difference Result 180903 states and 298698 transitions. [2019-09-10 06:33:56,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:33:56,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-10 06:33:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:56,450 INFO L225 Difference]: With dead ends: 180903 [2019-09-10 06:33:56,450 INFO L226 Difference]: Without dead ends: 180903 [2019-09-10 06:33:56,451 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 06:33:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180903 states. [2019-09-10 06:34:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180903 to 151264. [2019-09-10 06:34:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151264 states. [2019-09-10 06:34:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151264 states to 151264 states and 249210 transitions. [2019-09-10 06:34:01,451 INFO L78 Accepts]: Start accepts. Automaton has 151264 states and 249210 transitions. Word has length 230 [2019-09-10 06:34:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:01,451 INFO L475 AbstractCegarLoop]: Abstraction has 151264 states and 249210 transitions. [2019-09-10 06:34:01,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:34:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 151264 states and 249210 transitions. [2019-09-10 06:34:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 06:34:01,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:01,456 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] [2019-09-10 06:34:01,456 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:01,457 INFO L82 PathProgramCache]: Analyzing trace with hash -176858447, now seen corresponding path program 1 times [2019-09-10 06:34:01,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:01,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:01,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:01,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:01,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:01,648 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 06:34:01,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:01,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:34:01,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:01,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:34:01,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:34:01,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:34:01,651 INFO L87 Difference]: Start difference. First operand 151264 states and 249210 transitions. Second operand 4 states. [2019-09-10 06:34:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:02,568 INFO L93 Difference]: Finished difference Result 296255 states and 488348 transitions. [2019-09-10 06:34:02,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:34:02,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-10 06:34:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:03,137 INFO L225 Difference]: With dead ends: 296255 [2019-09-10 06:34:03,137 INFO L226 Difference]: Without dead ends: 296255 [2019-09-10 06:34:03,137 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 06:34:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296255 states. [2019-09-10 06:34:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296255 to 248194. [2019-09-10 06:34:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248194 states. [2019-09-10 06:34:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248194 states to 248194 states and 408192 transitions. [2019-09-10 06:34:09,526 INFO L78 Accepts]: Start accepts. Automaton has 248194 states and 408192 transitions. Word has length 231 [2019-09-10 06:34:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:09,526 INFO L475 AbstractCegarLoop]: Abstraction has 248194 states and 408192 transitions. [2019-09-10 06:34:09,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:34:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 248194 states and 408192 transitions. [2019-09-10 06:34:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 06:34:09,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:09,531 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] [2019-09-10 06:34:09,531 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1244696513, now seen corresponding path program 1 times [2019-09-10 06:34:09,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:09,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:09,814 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 06:34:09,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:09,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:34:09,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:09,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:34:09,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:34:09,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:34:09,816 INFO L87 Difference]: Start difference. First operand 248194 states and 408192 transitions. Second operand 4 states. [2019-09-10 06:34:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:11,841 INFO L93 Difference]: Finished difference Result 488672 states and 804065 transitions. [2019-09-10 06:34:11,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:34:11,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-10 06:34:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:12,623 INFO L225 Difference]: With dead ends: 488672 [2019-09-10 06:34:12,623 INFO L226 Difference]: Without dead ends: 488672 [2019-09-10 06:34:12,623 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 06:34:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488672 states. [2019-09-10 06:34:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488672 to 405720. [2019-09-10 06:34:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405720 states. [2019-09-10 06:34:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405720 states to 405720 states and 666142 transitions. [2019-09-10 06:34:28,862 INFO L78 Accepts]: Start accepts. Automaton has 405720 states and 666142 transitions. Word has length 232 [2019-09-10 06:34:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:28,862 INFO L475 AbstractCegarLoop]: Abstraction has 405720 states and 666142 transitions. [2019-09-10 06:34:28,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:34:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 405720 states and 666142 transitions. [2019-09-10 06:34:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 06:34:28,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:28,865 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 06:34:28,865 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:28,865 INFO L82 PathProgramCache]: Analyzing trace with hash 16619832, now seen corresponding path program 1 times [2019-09-10 06:34:28,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:28,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:28,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:28,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:28,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:29,184 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 06:34:29,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:29,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:34:29,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:29,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:34:29,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:34:29,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:34:29,186 INFO L87 Difference]: Start difference. First operand 405720 states and 666142 transitions. Second operand 8 states. [2019-09-10 06:34:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:47,187 INFO L93 Difference]: Finished difference Result 1832147 states and 3010961 transitions. [2019-09-10 06:34:47,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:34:47,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2019-09-10 06:34:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:50,024 INFO L225 Difference]: With dead ends: 1832147 [2019-09-10 06:34:50,024 INFO L226 Difference]: Without dead ends: 1832147 [2019-09-10 06:34:50,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:34:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832147 states. [2019-09-10 06:35:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832147 to 1110422. [2019-09-10 06:35:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110422 states. [2019-09-10 06:35:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110422 states to 1110422 states and 1815836 transitions. [2019-09-10 06:35:37,977 INFO L78 Accepts]: Start accepts. Automaton has 1110422 states and 1815836 transitions. Word has length 233 [2019-09-10 06:35:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:37,978 INFO L475 AbstractCegarLoop]: Abstraction has 1110422 states and 1815836 transitions. [2019-09-10 06:35:37,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:35:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1110422 states and 1815836 transitions. [2019-09-10 06:35:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 06:35:37,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:37,980 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] [2019-09-10 06:35:37,980 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1597136680, now seen corresponding path program 1 times [2019-09-10 06:35:37,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:37,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:37,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:38,490 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 06:35:38,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:38,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:35:38,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:38,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:35:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:35:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:38,492 INFO L87 Difference]: Start difference. First operand 1110422 states and 1815836 transitions. Second operand 7 states. [2019-09-10 06:35:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:58,746 INFO L93 Difference]: Finished difference Result 1576882 states and 2580621 transitions. [2019-09-10 06:35:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:35:58,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-10 06:35:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:01,348 INFO L225 Difference]: With dead ends: 1576882 [2019-09-10 06:36:01,348 INFO L226 Difference]: Without dead ends: 1576882 [2019-09-10 06:36:01,349 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 06:36:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576882 states. [2019-09-10 06:36:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576882 to 1110422. [2019-09-10 06:36:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110422 states. [2019-09-10 06:36:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110422 states to 1110422 states and 1812711 transitions. [2019-09-10 06:36:57,997 INFO L78 Accepts]: Start accepts. Automaton has 1110422 states and 1812711 transitions. Word has length 235 [2019-09-10 06:36:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:57,997 INFO L475 AbstractCegarLoop]: Abstraction has 1110422 states and 1812711 transitions. [2019-09-10 06:36:57,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:36:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1110422 states and 1812711 transitions. [2019-09-10 06:36:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 06:36:57,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:58,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:36:58,000 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1397893136, now seen corresponding path program 1 times [2019-09-10 06:36:58,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:58,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:58,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:58,511 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 06:36:58,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:58,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:36:58,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:58,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:36:58,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:36:58,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:36:58,513 INFO L87 Difference]: Start difference. First operand 1110422 states and 1812711 transitions. Second operand 7 states. [2019-09-10 06:37:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:26,027 INFO L93 Difference]: Finished difference Result 2691953 states and 4398360 transitions. [2019-09-10 06:37:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:37:26,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 238 [2019-09-10 06:37:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:31,253 INFO L225 Difference]: With dead ends: 2691953 [2019-09-10 06:37:31,253 INFO L226 Difference]: Without dead ends: 2691953 [2019-09-10 06:37:31,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:37:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691953 states.