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.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:30:16,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:30:16,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:30:16,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:30:16,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:30:16,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:30:16,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:30:16,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:30:16,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:30:16,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:30:16,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:30:16,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:30:16,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:30:16,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:30:16,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:30:16,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:30:16,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:30:16,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:30:16,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:30:16,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:30:16,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:30:16,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:30:16,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:30:16,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:30:16,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:30:16,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:30:16,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:30:16,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:30:16,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:30:16,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:30:16,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:30:16,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:30:16,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:30:16,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:30:16,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:30:16,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:30:16,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:30:16,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:30:16,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:30:16,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:30:16,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:30:16,844 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:30:16,857 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:30:16,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:30:16,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:30:16,858 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:30:16,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:30:16,859 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:30:16,859 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:30:16,860 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:30:16,860 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:30:16,860 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:30:16,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:30:16,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:30:16,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:30:16,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:30:16,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:30:16,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:30:16,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:30:16,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:30:16,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:30:16,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:30:16,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:30:16,863 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:30:16,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:30:16,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:30:16,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:30:16,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:30:16,864 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:30:16,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:30:16,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:30:16,864 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:30:16,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:30:16,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:30:16,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:30:16,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:30:16,912 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:30:16,914 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.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:30:16,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8549664f/124d99319a7f40baa508728280f600b6/FLAGc112a7ad0 [2019-09-10 06:30:17,584 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:30:17,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:30:17,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8549664f/124d99319a7f40baa508728280f600b6/FLAGc112a7ad0 [2019-09-10 06:30:17,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8549664f/124d99319a7f40baa508728280f600b6 [2019-09-10 06:30:17,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:30:17,801 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:30:17,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:30:17,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:30:17,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:30:17,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:30:17" (1/1) ... [2019-09-10 06:30:17,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300edefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:17, skipping insertion in model container [2019-09-10 06:30:17,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:30:17" (1/1) ... [2019-09-10 06:30:17,822 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:30:17,937 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:30:18,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:30:18,766 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:30:19,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:30:19,083 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:30:19,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19 WrapperNode [2019-09-10 06:30:19,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:30:19,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:30:19,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:30:19,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:30:19,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (1/1) ... [2019-09-10 06:30:19,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (1/1) ... [2019-09-10 06:30:19,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (1/1) ... [2019-09-10 06:30:19,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (1/1) ... [2019-09-10 06:30:19,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (1/1) ... [2019-09-10 06:30:19,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (1/1) ... [2019-09-10 06:30:19,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (1/1) ... [2019-09-10 06:30:19,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:30:19,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:30:19,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:30:19,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:30:19,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (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:30:19,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:30:19,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:30:19,325 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:30:19,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:30:19,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:30:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:30:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:30:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:30:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:30:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:30:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:30:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:30:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:30:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:30:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:30:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:30:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:30:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:30:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:30:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:30:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:30:21,944 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:30:21,945 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:30:21,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:30:21 BoogieIcfgContainer [2019-09-10 06:30:21,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:30:21,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:30:21,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:30:21,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:30:21,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:30:17" (1/3) ... [2019-09-10 06:30:21,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50897329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:30:21, skipping insertion in model container [2019-09-10 06:30:21,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:19" (2/3) ... [2019-09-10 06:30:21,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50897329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:30:21, skipping insertion in model container [2019-09-10 06:30:21,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:30:21" (3/3) ... [2019-09-10 06:30:21,955 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:30:21,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:30:21,977 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:30:21,995 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:30:22,026 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:30:22,026 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:30:22,026 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:30:22,026 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:30:22,026 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:30:22,027 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:30:22,027 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:30:22,027 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:30:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2019-09-10 06:30:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 06:30:22,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:22,113 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] [2019-09-10 06:30:22,115 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1282836936, now seen corresponding path program 1 times [2019-09-10 06:30:22,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:22,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:22,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:22,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:22,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:22,965 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:30:22,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:22,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:22,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:22,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:22,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:22,990 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2019-09-10 06:30:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:23,205 INFO L93 Difference]: Finished difference Result 940 states and 1679 transitions. [2019-09-10 06:30:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:23,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-10 06:30:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:23,242 INFO L225 Difference]: With dead ends: 940 [2019-09-10 06:30:23,242 INFO L226 Difference]: Without dead ends: 932 [2019-09-10 06:30:23,244 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:30:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-09-10 06:30:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2019-09-10 06:30:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-10 06:30:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1610 transitions. [2019-09-10 06:30:23,400 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1610 transitions. Word has length 207 [2019-09-10 06:30:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:23,401 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1610 transitions. [2019-09-10 06:30:23,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1610 transitions. [2019-09-10 06:30:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 06:30:23,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:23,408 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] [2019-09-10 06:30:23,409 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1286222293, now seen corresponding path program 1 times [2019-09-10 06:30:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:23,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:23,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:23,634 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:30:23,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:23,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:23,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:23,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:23,637 INFO L87 Difference]: Start difference. First operand 929 states and 1610 transitions. Second operand 3 states. [2019-09-10 06:30:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:23,691 INFO L93 Difference]: Finished difference Result 1289 states and 2207 transitions. [2019-09-10 06:30:23,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:23,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-10 06:30:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:23,701 INFO L225 Difference]: With dead ends: 1289 [2019-09-10 06:30:23,701 INFO L226 Difference]: Without dead ends: 1289 [2019-09-10 06:30:23,702 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:30:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-09-10 06:30:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1285. [2019-09-10 06:30:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1285 states. [2019-09-10 06:30:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2204 transitions. [2019-09-10 06:30:23,753 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2204 transitions. Word has length 211 [2019-09-10 06:30:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:23,755 INFO L475 AbstractCegarLoop]: Abstraction has 1285 states and 2204 transitions. [2019-09-10 06:30:23,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2204 transitions. [2019-09-10 06:30:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 06:30:23,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:23,765 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] [2019-09-10 06:30:23,766 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:23,767 INFO L82 PathProgramCache]: Analyzing trace with hash -868029736, now seen corresponding path program 1 times [2019-09-10 06:30:23,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:23,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:23,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:24,169 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:30:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:24,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:24,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:24,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:24,171 INFO L87 Difference]: Start difference. First operand 1285 states and 2204 transitions. Second operand 3 states. [2019-09-10 06:30:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:24,233 INFO L93 Difference]: Finished difference Result 1979 states and 3349 transitions. [2019-09-10 06:30:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:24,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-09-10 06:30:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:24,249 INFO L225 Difference]: With dead ends: 1979 [2019-09-10 06:30:24,249 INFO L226 Difference]: Without dead ends: 1979 [2019-09-10 06:30:24,250 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:30:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-09-10 06:30:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1973. [2019-09-10 06:30:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-09-10 06:30:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3344 transitions. [2019-09-10 06:30:24,307 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 3344 transitions. Word has length 215 [2019-09-10 06:30:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:24,307 INFO L475 AbstractCegarLoop]: Abstraction has 1973 states and 3344 transitions. [2019-09-10 06:30:24,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 3344 transitions. [2019-09-10 06:30:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 06:30:24,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:24,314 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] [2019-09-10 06:30:24,314 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash 737497141, now seen corresponding path program 1 times [2019-09-10 06:30:24,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:24,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:24,591 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:30:24,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:24,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:24,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:24,593 INFO L87 Difference]: Start difference. First operand 1973 states and 3344 transitions. Second operand 3 states. [2019-09-10 06:30:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:24,666 INFO L93 Difference]: Finished difference Result 3311 states and 5537 transitions. [2019-09-10 06:30:24,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:24,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-10 06:30:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:24,686 INFO L225 Difference]: With dead ends: 3311 [2019-09-10 06:30:24,686 INFO L226 Difference]: Without dead ends: 3311 [2019-09-10 06:30:24,687 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:30:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2019-09-10 06:30:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 3301. [2019-09-10 06:30:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3301 states. [2019-09-10 06:30:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 5528 transitions. [2019-09-10 06:30:24,782 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 5528 transitions. Word has length 219 [2019-09-10 06:30:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:24,782 INFO L475 AbstractCegarLoop]: Abstraction has 3301 states and 5528 transitions. [2019-09-10 06:30:24,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 5528 transitions. [2019-09-10 06:30:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 06:30:24,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:24,790 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] [2019-09-10 06:30:24,790 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1131624312, now seen corresponding path program 1 times [2019-09-10 06:30:24,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:24,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:24,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:24,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:25,084 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:30:25,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:25,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:25,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:25,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:25,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:25,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:25,087 INFO L87 Difference]: Start difference. First operand 3301 states and 5528 transitions. Second operand 3 states. [2019-09-10 06:30:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:25,200 INFO L93 Difference]: Finished difference Result 5879 states and 9721 transitions. [2019-09-10 06:30:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:25,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-09-10 06:30:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:25,245 INFO L225 Difference]: With dead ends: 5879 [2019-09-10 06:30:25,245 INFO L226 Difference]: Without dead ends: 5879 [2019-09-10 06:30:25,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:30:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2019-09-10 06:30:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5861. [2019-09-10 06:30:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5861 states. [2019-09-10 06:30:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5861 states to 5861 states and 9704 transitions. [2019-09-10 06:30:25,453 INFO L78 Accepts]: Start accepts. Automaton has 5861 states and 9704 transitions. Word has length 223 [2019-09-10 06:30:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:25,454 INFO L475 AbstractCegarLoop]: Abstraction has 5861 states and 9704 transitions. [2019-09-10 06:30:25,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5861 states and 9704 transitions. [2019-09-10 06:30:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 06:30:25,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:25,465 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] [2019-09-10 06:30:25,466 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1933153941, now seen corresponding path program 1 times [2019-09-10 06:30:25,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:25,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:25,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:25,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:30:25,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:25,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:30:25,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:25,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:30:25,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:30:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:30:25,984 INFO L87 Difference]: Start difference. First operand 5861 states and 9704 transitions. Second operand 7 states. [2019-09-10 06:30:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:26,939 INFO L93 Difference]: Finished difference Result 30254 states and 50119 transitions. [2019-09-10 06:30:26,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:30:26,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 227 [2019-09-10 06:30:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:27,079 INFO L225 Difference]: With dead ends: 30254 [2019-09-10 06:30:27,079 INFO L226 Difference]: Without dead ends: 30254 [2019-09-10 06:30:27,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:30:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30254 states. [2019-09-10 06:30:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30254 to 11038. [2019-09-10 06:30:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11038 states. [2019-09-10 06:30:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11038 states to 11038 states and 18183 transitions. [2019-09-10 06:30:27,565 INFO L78 Accepts]: Start accepts. Automaton has 11038 states and 18183 transitions. Word has length 227 [2019-09-10 06:30:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:27,565 INFO L475 AbstractCegarLoop]: Abstraction has 11038 states and 18183 transitions. [2019-09-10 06:30:27,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:30:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 11038 states and 18183 transitions. [2019-09-10 06:30:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 06:30:27,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:27,580 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:30:27,587 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash -272495972, now seen corresponding path program 1 times [2019-09-10 06:30:27,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:27,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:27,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:27,899 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:30:27,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:27,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:27,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:27,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:27,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:27,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:27,901 INFO L87 Difference]: Start difference. First operand 11038 states and 18183 transitions. Second operand 4 states. [2019-09-10 06:30:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:28,083 INFO L93 Difference]: Finished difference Result 19048 states and 31481 transitions. [2019-09-10 06:30:28,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:28,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-09-10 06:30:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:28,138 INFO L225 Difference]: With dead ends: 19048 [2019-09-10 06:30:28,139 INFO L226 Difference]: Without dead ends: 19048 [2019-09-10 06:30:28,139 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:30:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19048 states. [2019-09-10 06:30:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19048 to 16394. [2019-09-10 06:30:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16394 states. [2019-09-10 06:30:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16394 states to 16394 states and 27034 transitions. [2019-09-10 06:30:28,493 INFO L78 Accepts]: Start accepts. Automaton has 16394 states and 27034 transitions. Word has length 228 [2019-09-10 06:30:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:28,493 INFO L475 AbstractCegarLoop]: Abstraction has 16394 states and 27034 transitions. [2019-09-10 06:30:28,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 16394 states and 27034 transitions. [2019-09-10 06:30:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:30:28,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:28,507 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:30:28,507 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:28,508 INFO L82 PathProgramCache]: Analyzing trace with hash 76391484, now seen corresponding path program 1 times [2019-09-10 06:30:28,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:28,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:28,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:28,743 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:30:28,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:28,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:28,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:28,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:28,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:28,746 INFO L87 Difference]: Start difference. First operand 16394 states and 27034 transitions. Second operand 4 states. [2019-09-10 06:30:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:29,045 INFO L93 Difference]: Finished difference Result 28312 states and 46724 transitions. [2019-09-10 06:30:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:29,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-10 06:30:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:29,133 INFO L225 Difference]: With dead ends: 28312 [2019-09-10 06:30:29,133 INFO L226 Difference]: Without dead ends: 28312 [2019-09-10 06:30:29,134 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:30:29,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28312 states. [2019-09-10 06:30:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28312 to 24393. [2019-09-10 06:30:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24393 states. [2019-09-10 06:30:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24393 states to 24393 states and 40188 transitions. [2019-09-10 06:30:29,633 INFO L78 Accepts]: Start accepts. Automaton has 24393 states and 40188 transitions. Word has length 229 [2019-09-10 06:30:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:29,633 INFO L475 AbstractCegarLoop]: Abstraction has 24393 states and 40188 transitions. [2019-09-10 06:30:29,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 24393 states and 40188 transitions. [2019-09-10 06:30:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:30:29,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:29,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:29,651 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash -206478650, now seen corresponding path program 1 times [2019-09-10 06:30:29,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:29,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:29,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:29,830 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:30:29,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:29,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:29,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:29,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:29,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:29,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:29,832 INFO L87 Difference]: Start difference. First operand 24393 states and 40188 transitions. Second operand 3 states. [2019-09-10 06:30:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:30,064 INFO L93 Difference]: Finished difference Result 37565 states and 61906 transitions. [2019-09-10 06:30:30,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:30,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-10 06:30:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:30,145 INFO L225 Difference]: With dead ends: 37565 [2019-09-10 06:30:30,146 INFO L226 Difference]: Without dead ends: 37565 [2019-09-10 06:30:30,147 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:30:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37565 states. [2019-09-10 06:30:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37565 to 37563. [2019-09-10 06:30:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37563 states. [2019-09-10 06:30:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37563 states to 37563 states and 61905 transitions. [2019-09-10 06:30:30,645 INFO L78 Accepts]: Start accepts. Automaton has 37563 states and 61905 transitions. Word has length 230 [2019-09-10 06:30:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:30,645 INFO L475 AbstractCegarLoop]: Abstraction has 37563 states and 61905 transitions. [2019-09-10 06:30:30,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 37563 states and 61905 transitions. [2019-09-10 06:30:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:30:30,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:30,654 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:30:30,654 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1531075737, now seen corresponding path program 1 times [2019-09-10 06:30:30,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:30,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:30,875 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:30:30,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:30,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:30,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:30,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:30,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:30,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:30,881 INFO L87 Difference]: Start difference. First operand 37563 states and 61905 transitions. Second operand 3 states. [2019-09-10 06:30:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:32,078 INFO L93 Difference]: Finished difference Result 57580 states and 94738 transitions. [2019-09-10 06:30:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:32,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-10 06:30:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:32,213 INFO L225 Difference]: With dead ends: 57580 [2019-09-10 06:30:32,214 INFO L226 Difference]: Without dead ends: 57580 [2019-09-10 06:30:32,214 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:30:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57580 states. [2019-09-10 06:30:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57580 to 57578. [2019-09-10 06:30:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57578 states. [2019-09-10 06:30:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57578 states to 57578 states and 94737 transitions. [2019-09-10 06:30:33,109 INFO L78 Accepts]: Start accepts. Automaton has 57578 states and 94737 transitions. Word has length 230 [2019-09-10 06:30:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:33,110 INFO L475 AbstractCegarLoop]: Abstraction has 57578 states and 94737 transitions. [2019-09-10 06:30:33,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 57578 states and 94737 transitions. [2019-09-10 06:30:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:30:33,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:33,115 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:30:33,115 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:33,116 INFO L82 PathProgramCache]: Analyzing trace with hash -727220740, now seen corresponding path program 1 times [2019-09-10 06:30:33,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:33,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:33,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:33,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:33,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:33,589 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:30:33,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:33,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:33,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:33,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:33,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:33,592 INFO L87 Difference]: Start difference. First operand 57578 states and 94737 transitions. Second operand 3 states. [2019-09-10 06:30:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:33,904 INFO L93 Difference]: Finished difference Result 80883 states and 132953 transitions. [2019-09-10 06:30:33,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:33,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-10 06:30:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:34,038 INFO L225 Difference]: With dead ends: 80883 [2019-09-10 06:30:34,038 INFO L226 Difference]: Without dead ends: 80883 [2019-09-10 06:30:34,040 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:30:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80883 states. [2019-09-10 06:30:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80883 to 80881. [2019-09-10 06:30:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80881 states. [2019-09-10 06:30:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80881 states to 80881 states and 132952 transitions. [2019-09-10 06:30:37,310 INFO L78 Accepts]: Start accepts. Automaton has 80881 states and 132952 transitions. Word has length 230 [2019-09-10 06:30:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:37,310 INFO L475 AbstractCegarLoop]: Abstraction has 80881 states and 132952 transitions. [2019-09-10 06:30:37,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 80881 states and 132952 transitions. [2019-09-10 06:30:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:30:37,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:37,315 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:30:37,315 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:37,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1521949134, now seen corresponding path program 1 times [2019-09-10 06:30:37,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:37,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:37,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:37,567 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:30:37,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:37,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:37,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:37,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:37,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:37,571 INFO L87 Difference]: Start difference. First operand 80881 states and 132952 transitions. Second operand 3 states. [2019-09-10 06:30:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:37,990 INFO L93 Difference]: Finished difference Result 112965 states and 185520 transitions. [2019-09-10 06:30:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:37,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-10 06:30:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:38,169 INFO L225 Difference]: With dead ends: 112965 [2019-09-10 06:30:38,170 INFO L226 Difference]: Without dead ends: 112965 [2019-09-10 06:30:38,170 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:30:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112965 states. [2019-09-10 06:30:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112965 to 112963. [2019-09-10 06:30:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112963 states. [2019-09-10 06:30:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112963 states to 112963 states and 185519 transitions. [2019-09-10 06:30:39,590 INFO L78 Accepts]: Start accepts. Automaton has 112963 states and 185519 transitions. Word has length 230 [2019-09-10 06:30:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:39,590 INFO L475 AbstractCegarLoop]: Abstraction has 112963 states and 185519 transitions. [2019-09-10 06:30:39,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 112963 states and 185519 transitions. [2019-09-10 06:30:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:30:39,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:39,595 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:30:39,595 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1988441245, now seen corresponding path program 1 times [2019-09-10 06:30:39,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:39,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:39,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:39,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:39,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:39,773 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:30:39,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:39,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:39,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:39,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:39,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:39,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:39,775 INFO L87 Difference]: Start difference. First operand 112963 states and 185519 transitions. Second operand 4 states. [2019-09-10 06:30:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:43,032 INFO L93 Difference]: Finished difference Result 220355 states and 362236 transitions. [2019-09-10 06:30:43,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:43,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-10 06:30:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:43,364 INFO L225 Difference]: With dead ends: 220355 [2019-09-10 06:30:43,365 INFO L226 Difference]: Without dead ends: 220355 [2019-09-10 06:30:43,365 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:30:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220355 states. [2019-09-10 06:30:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220355 to 185001. [2019-09-10 06:30:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185001 states. [2019-09-10 06:30:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185001 states to 185001 states and 303458 transitions. [2019-09-10 06:30:45,241 INFO L78 Accepts]: Start accepts. Automaton has 185001 states and 303458 transitions. Word has length 230 [2019-09-10 06:30:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:45,241 INFO L475 AbstractCegarLoop]: Abstraction has 185001 states and 303458 transitions. [2019-09-10 06:30:45,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 185001 states and 303458 transitions. [2019-09-10 06:30:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:30:45,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:45,246 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:30:45,247 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash 382821809, now seen corresponding path program 1 times [2019-09-10 06:30:45,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:45,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:45,413 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:30:45,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:45,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:45,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:45,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:45,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:45,416 INFO L87 Difference]: Start difference. First operand 185001 states and 303458 transitions. Second operand 3 states. [2019-09-10 06:30:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:49,405 INFO L93 Difference]: Finished difference Result 257087 states and 421257 transitions. [2019-09-10 06:30:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:49,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-10 06:30:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:49,838 INFO L225 Difference]: With dead ends: 257087 [2019-09-10 06:30:49,838 INFO L226 Difference]: Without dead ends: 257087 [2019-09-10 06:30:49,839 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:30:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257087 states. [2019-09-10 06:30:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257087 to 257085. [2019-09-10 06:30:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257085 states. [2019-09-10 06:30:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257085 states to 257085 states and 421256 transitions. [2019-09-10 06:30:52,418 INFO L78 Accepts]: Start accepts. Automaton has 257085 states and 421256 transitions. Word has length 230 [2019-09-10 06:30:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:52,419 INFO L475 AbstractCegarLoop]: Abstraction has 257085 states and 421256 transitions. [2019-09-10 06:30:52,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 257085 states and 421256 transitions. [2019-09-10 06:30:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 06:30:52,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:52,423 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:30:52,423 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:52,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1569188381, now seen corresponding path program 1 times [2019-09-10 06:30:52,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:52,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:52,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:52,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:52,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:52,686 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:30:52,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:52,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:52,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:52,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:52,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:52,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:52,689 INFO L87 Difference]: Start difference. First operand 257085 states and 421256 transitions. Second operand 4 states. [2019-09-10 06:30:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:57,420 INFO L93 Difference]: Finished difference Result 506347 states and 830407 transitions. [2019-09-10 06:30:57,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:57,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-10 06:30:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:58,349 INFO L225 Difference]: With dead ends: 506347 [2019-09-10 06:30:58,349 INFO L226 Difference]: Without dead ends: 506347 [2019-09-10 06:30:58,349 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:30:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506347 states. [2019-09-10 06:31:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506347 to 420395. [2019-09-10 06:31:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420395 states. [2019-09-10 06:31:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420395 states to 420395 states and 687959 transitions. [2019-09-10 06:31:04,088 INFO L78 Accepts]: Start accepts. Automaton has 420395 states and 687959 transitions. Word has length 231 [2019-09-10 06:31:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:04,088 INFO L475 AbstractCegarLoop]: Abstraction has 420395 states and 687959 transitions. [2019-09-10 06:31:04,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:31:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 420395 states and 687959 transitions. [2019-09-10 06:31:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 06:31:04,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:04,091 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:31:04,091 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1452693462, now seen corresponding path program 1 times [2019-09-10 06:31:04,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:04,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:04,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:04,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:10,695 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:31:10,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:10,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:31:10,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:10,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:31:10,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:31:10,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:31:10,699 INFO L87 Difference]: Start difference. First operand 420395 states and 687959 transitions. Second operand 8 states. [2019-09-10 06:31:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:23,420 INFO L93 Difference]: Finished difference Result 1901646 states and 3116435 transitions. [2019-09-10 06:31:23,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:31:23,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-09-10 06:31:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:26,633 INFO L225 Difference]: With dead ends: 1901646 [2019-09-10 06:31:26,634 INFO L226 Difference]: Without dead ends: 1901646 [2019-09-10 06:31:26,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:31:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901646 states. [2019-09-10 06:32:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901646 to 1152273. [2019-09-10 06:32:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152273 states. [2019-09-10 06:32:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152273 states to 1152273 states and 1878846 transitions. [2019-09-10 06:32:27,415 INFO L78 Accepts]: Start accepts. Automaton has 1152273 states and 1878846 transitions. Word has length 232 [2019-09-10 06:32:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:27,415 INFO L475 AbstractCegarLoop]: Abstraction has 1152273 states and 1878846 transitions. [2019-09-10 06:32:27,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:32:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1152273 states and 1878846 transitions. [2019-09-10 06:32:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 06:32:27,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:27,418 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] [2019-09-10 06:32:27,418 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:27,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1663665062, now seen corresponding path program 1 times [2019-09-10 06:32:27,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:27,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:27,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:27,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:27,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:28,005 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:32:28,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:28,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:32:28,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:28,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:32:28,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:32:28,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:32:28,008 INFO L87 Difference]: Start difference. First operand 1152273 states and 1878846 transitions. Second operand 7 states. [2019-09-10 06:32:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:50,565 INFO L93 Difference]: Finished difference Result 1636141 states and 2669807 transitions. [2019-09-10 06:32:50,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:32:50,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2019-09-10 06:32:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:53,513 INFO L225 Difference]: With dead ends: 1636141 [2019-09-10 06:32:53,514 INFO L226 Difference]: Without dead ends: 1636141 [2019-09-10 06:32:53,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:32:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636141 states. [2019-09-10 06:33:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636141 to 1152273. [2019-09-10 06:33:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152273 states. [2019-09-10 06:33:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152273 states to 1152273 states and 1875721 transitions. [2019-09-10 06:33:33,769 INFO L78 Accepts]: Start accepts. Automaton has 1152273 states and 1875721 transitions. Word has length 234 [2019-09-10 06:33:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:33,769 INFO L475 AbstractCegarLoop]: Abstraction has 1152273 states and 1875721 transitions. [2019-09-10 06:33:33,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:33:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1152273 states and 1875721 transitions. [2019-09-10 06:33:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 06:33:33,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:33,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:33,772 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:33,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -372266284, now seen corresponding path program 1 times [2019-09-10 06:33:33,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:33,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:33,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat