java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:06:25,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:06:25,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:06:25,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:06:25,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:06:25,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:06:25,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:06:25,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:06:25,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:06:25,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:06:25,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:06:25,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:06:25,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:06:25,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:06:25,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:06:25,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:06:25,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:06:25,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:06:25,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:06:25,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:06:25,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:06:25,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:06:25,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:06:25,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:06:25,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:06:25,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:06:25,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:06:25,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:06:25,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:06:25,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:06:25,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:06:25,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:06:25,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:06:25,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:06:25,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:06:25,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:06:25,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:06:25,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:06:25,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:06:25,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:06:25,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:06:25,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 09:06:25,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:06:25,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:06:25,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:06:25,079 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:06:25,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:06:25,080 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:06:25,081 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:06:25,081 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:06:25,081 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:06:25,081 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:06:25,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:06:25,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:06:25,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:06:25,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:06:25,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:06:25,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:06:25,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:06:25,084 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:06:25,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:06:25,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:06:25,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:06:25,085 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:06:25,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:06:25,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:06:25,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:06:25,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:06:25,087 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:06:25,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:06:25,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:06:25,087 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:06:25,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:06:25,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:06:25,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:06:25,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:06:25,160 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:06:25,161 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:06:25,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffad4f08/b3a1410966704c62977e2f3f2ea5cb96/FLAGb788c6cbf [2019-09-10 09:06:25,977 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:06:25,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:06:26,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffad4f08/b3a1410966704c62977e2f3f2ea5cb96/FLAGb788c6cbf [2019-09-10 09:06:26,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffad4f08/b3a1410966704c62977e2f3f2ea5cb96 [2019-09-10 09:06:26,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:06:26,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:06:26,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:26,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:06:26,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:06:26,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:26" (1/1) ... [2019-09-10 09:06:26,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2231e286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:26, skipping insertion in model container [2019-09-10 09:06:26,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:26" (1/1) ... [2019-09-10 09:06:26,103 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:06:26,251 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:06:27,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:27,691 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:06:28,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:28,762 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:06:28,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28 WrapperNode [2019-09-10 09:06:28,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:28,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:06:28,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:06:28,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:06:28,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (1/1) ... [2019-09-10 09:06:28,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (1/1) ... [2019-09-10 09:06:28,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (1/1) ... [2019-09-10 09:06:28,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (1/1) ... [2019-09-10 09:06:28,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (1/1) ... [2019-09-10 09:06:28,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (1/1) ... [2019-09-10 09:06:28,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (1/1) ... [2019-09-10 09:06:29,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:06:29,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:06:29,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:06:29,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:06:29,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:06:29,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:06:29,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:06:29,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:06:29,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:06:29,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:06:29,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:06:29,084 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:06:29,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:06:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:06:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:06:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:06:29,086 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:06:29,086 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:06:29,087 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:06:29,087 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:06:29,088 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:06:29,088 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:06:29,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:06:29,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:06:29,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:06:33,750 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:06:33,751 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:06:33,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:33 BoogieIcfgContainer [2019-09-10 09:06:33,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:06:33,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:06:33,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:06:33,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:06:33,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:06:26" (1/3) ... [2019-09-10 09:06:33,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43441885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:33, skipping insertion in model container [2019-09-10 09:06:33,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:28" (2/3) ... [2019-09-10 09:06:33,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43441885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:33, skipping insertion in model container [2019-09-10 09:06:33,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:33" (3/3) ... [2019-09-10 09:06:33,768 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:06:33,779 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:06:33,790 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:06:33,812 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:06:33,848 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:06:33,849 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:06:33,849 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:06:33,849 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:06:33,849 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:06:33,849 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:06:33,849 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:06:33,850 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:06:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states. [2019-09-10 09:06:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-10 09:06:33,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:33,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:33,954 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:33,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash 691893381, now seen corresponding path program 1 times [2019-09-10 09:06:33,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:34,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:34,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:34,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:35,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:35,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:35,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:35,078 INFO L87 Difference]: Start difference. First operand 1549 states. Second operand 3 states. [2019-09-10 09:06:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:35,315 INFO L93 Difference]: Finished difference Result 2106 states and 3696 transitions. [2019-09-10 09:06:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:35,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-10 09:06:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:35,360 INFO L225 Difference]: With dead ends: 2106 [2019-09-10 09:06:35,361 INFO L226 Difference]: Without dead ends: 2098 [2019-09-10 09:06:35,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2019-09-10 09:06:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2096. [2019-09-10 09:06:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-09-10 09:06:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3502 transitions. [2019-09-10 09:06:35,532 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3502 transitions. Word has length 396 [2019-09-10 09:06:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:35,538 INFO L475 AbstractCegarLoop]: Abstraction has 2096 states and 3502 transitions. [2019-09-10 09:06:35,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3502 transitions. [2019-09-10 09:06:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-10 09:06:35,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:35,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:35,555 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1022638736, now seen corresponding path program 1 times [2019-09-10 09:06:35,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:35,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:35,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:36,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:36,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:36,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:36,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:36,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:36,071 INFO L87 Difference]: Start difference. First operand 2096 states and 3502 transitions. Second operand 3 states. [2019-09-10 09:06:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:36,194 INFO L93 Difference]: Finished difference Result 3022 states and 5004 transitions. [2019-09-10 09:06:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:36,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-10 09:06:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:36,214 INFO L225 Difference]: With dead ends: 3022 [2019-09-10 09:06:36,214 INFO L226 Difference]: Without dead ends: 3022 [2019-09-10 09:06:36,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-10 09:06:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3020. [2019-09-10 09:06:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-09-10 09:06:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 5003 transitions. [2019-09-10 09:06:36,304 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 5003 transitions. Word has length 396 [2019-09-10 09:06:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:36,306 INFO L475 AbstractCegarLoop]: Abstraction has 3020 states and 5003 transitions. [2019-09-10 09:06:36,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 5003 transitions. [2019-09-10 09:06:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-10 09:06:36,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:36,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:36,319 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1527350314, now seen corresponding path program 1 times [2019-09-10 09:06:36,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:36,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:36,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:36,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:36,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:36,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:36,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:36,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:36,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:36,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:36,759 INFO L87 Difference]: Start difference. First operand 3020 states and 5003 transitions. Second operand 3 states. [2019-09-10 09:06:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:36,862 INFO L93 Difference]: Finished difference Result 4656 states and 7649 transitions. [2019-09-10 09:06:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:36,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-10 09:06:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:36,894 INFO L225 Difference]: With dead ends: 4656 [2019-09-10 09:06:36,895 INFO L226 Difference]: Without dead ends: 4656 [2019-09-10 09:06:36,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2019-09-10 09:06:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4654. [2019-09-10 09:06:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4654 states. [2019-09-10 09:06:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 7648 transitions. [2019-09-10 09:06:37,026 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 7648 transitions. Word has length 396 [2019-09-10 09:06:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:37,027 INFO L475 AbstractCegarLoop]: Abstraction has 4654 states and 7648 transitions. [2019-09-10 09:06:37,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 7648 transitions. [2019-09-10 09:06:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-10 09:06:37,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:37,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:37,045 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:37,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash -519075533, now seen corresponding path program 1 times [2019-09-10 09:06:37,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:37,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:37,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:37,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:37,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:37,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:37,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:06:37,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:37,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:06:37,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:06:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:37,562 INFO L87 Difference]: Start difference. First operand 4654 states and 7648 transitions. Second operand 4 states. [2019-09-10 09:06:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:37,707 INFO L93 Difference]: Finished difference Result 6558 states and 10802 transitions. [2019-09-10 09:06:37,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:06:37,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2019-09-10 09:06:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:37,746 INFO L225 Difference]: With dead ends: 6558 [2019-09-10 09:06:37,747 INFO L226 Difference]: Without dead ends: 6558 [2019-09-10 09:06:37,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2019-09-10 09:06:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 5230. [2019-09-10 09:06:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5230 states. [2019-09-10 09:06:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 8624 transitions. [2019-09-10 09:06:38,026 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 8624 transitions. Word has length 396 [2019-09-10 09:06:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:38,032 INFO L475 AbstractCegarLoop]: Abstraction has 5230 states and 8624 transitions. [2019-09-10 09:06:38,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 8624 transitions. [2019-09-10 09:06:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-10 09:06:38,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:38,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:38,053 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1482848476, now seen corresponding path program 1 times [2019-09-10 09:06:38,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:38,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:38,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:38,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:38,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:38,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:38,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:38,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:38,539 INFO L87 Difference]: Start difference. First operand 5230 states and 8624 transitions. Second operand 3 states. [2019-09-10 09:06:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:38,734 INFO L93 Difference]: Finished difference Result 7612 states and 12573 transitions. [2019-09-10 09:06:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:38,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-10 09:06:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:38,813 INFO L225 Difference]: With dead ends: 7612 [2019-09-10 09:06:38,813 INFO L226 Difference]: Without dead ends: 7612 [2019-09-10 09:06:38,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7612 states. [2019-09-10 09:06:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7612 to 7610. [2019-09-10 09:06:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7610 states. [2019-09-10 09:06:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7610 states to 7610 states and 12572 transitions. [2019-09-10 09:06:39,056 INFO L78 Accepts]: Start accepts. Automaton has 7610 states and 12572 transitions. Word has length 396 [2019-09-10 09:06:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:39,057 INFO L475 AbstractCegarLoop]: Abstraction has 7610 states and 12572 transitions. [2019-09-10 09:06:39,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 7610 states and 12572 transitions. [2019-09-10 09:06:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-10 09:06:39,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:39,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:39,078 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash 594300889, now seen corresponding path program 1 times [2019-09-10 09:06:39,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:39,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:39,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:40,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:40,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:06:40,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:40,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:06:40,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:06:40,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:06:40,067 INFO L87 Difference]: Start difference. First operand 7610 states and 12572 transitions. Second operand 5 states. [2019-09-10 09:06:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:40,366 INFO L93 Difference]: Finished difference Result 19556 states and 32519 transitions. [2019-09-10 09:06:40,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:06:40,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 397 [2019-09-10 09:06:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:40,410 INFO L225 Difference]: With dead ends: 19556 [2019-09-10 09:06:40,410 INFO L226 Difference]: Without dead ends: 19556 [2019-09-10 09:06:40,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:06:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19556 states. [2019-09-10 09:06:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19556 to 14938. [2019-09-10 09:06:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14938 states. [2019-09-10 09:06:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14938 states to 14938 states and 24804 transitions. [2019-09-10 09:06:40,753 INFO L78 Accepts]: Start accepts. Automaton has 14938 states and 24804 transitions. Word has length 397 [2019-09-10 09:06:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:40,756 INFO L475 AbstractCegarLoop]: Abstraction has 14938 states and 24804 transitions. [2019-09-10 09:06:40,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:06:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14938 states and 24804 transitions. [2019-09-10 09:06:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-10 09:06:40,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:40,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:40,787 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1584378272, now seen corresponding path program 1 times [2019-09-10 09:06:40,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:40,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:40,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:40,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:40,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:41,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:41,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:41,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:41,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:41,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:41,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:41,566 INFO L87 Difference]: Start difference. First operand 14938 states and 24804 transitions. Second operand 3 states. [2019-09-10 09:06:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:41,668 INFO L93 Difference]: Finished difference Result 13184 states and 21949 transitions. [2019-09-10 09:06:41,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:41,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-10 09:06:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:41,702 INFO L225 Difference]: With dead ends: 13184 [2019-09-10 09:06:41,703 INFO L226 Difference]: Without dead ends: 13184 [2019-09-10 09:06:41,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13184 states. [2019-09-10 09:06:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13184 to 9962. [2019-09-10 09:06:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9962 states. [2019-09-10 09:06:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9962 states to 9962 states and 16584 transitions. [2019-09-10 09:06:41,900 INFO L78 Accepts]: Start accepts. Automaton has 9962 states and 16584 transitions. Word has length 398 [2019-09-10 09:06:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:41,901 INFO L475 AbstractCegarLoop]: Abstraction has 9962 states and 16584 transitions. [2019-09-10 09:06:41,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 9962 states and 16584 transitions. [2019-09-10 09:06:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-10 09:06:41,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:41,912 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:41,912 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:41,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:41,913 INFO L82 PathProgramCache]: Analyzing trace with hash -836761542, now seen corresponding path program 1 times [2019-09-10 09:06:41,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:41,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:41,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:41,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:41,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:42,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:42,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:06:42,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:42,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:06:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:06:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:06:42,665 INFO L87 Difference]: Start difference. First operand 9962 states and 16584 transitions. Second operand 7 states. [2019-09-10 09:06:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:43,116 INFO L93 Difference]: Finished difference Result 17554 states and 29326 transitions. [2019-09-10 09:06:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:06:43,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 402 [2019-09-10 09:06:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:43,156 INFO L225 Difference]: With dead ends: 17554 [2019-09-10 09:06:43,156 INFO L226 Difference]: Without dead ends: 17554 [2019-09-10 09:06:43,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:06:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17554 states. [2019-09-10 09:06:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17554 to 11250. [2019-09-10 09:06:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11250 states. [2019-09-10 09:06:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11250 states to 11250 states and 18756 transitions. [2019-09-10 09:06:43,389 INFO L78 Accepts]: Start accepts. Automaton has 11250 states and 18756 transitions. Word has length 402 [2019-09-10 09:06:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:43,390 INFO L475 AbstractCegarLoop]: Abstraction has 11250 states and 18756 transitions. [2019-09-10 09:06:43,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:06:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 11250 states and 18756 transitions. [2019-09-10 09:06:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:06:43,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:43,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:43,400 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash -989970102, now seen corresponding path program 1 times [2019-09-10 09:06:43,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:43,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:43,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:44,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:44,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:06:44,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:44,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:06:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:06:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:06:44,635 INFO L87 Difference]: Start difference. First operand 11250 states and 18756 transitions. Second operand 4 states. [2019-09-10 09:06:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:44,831 INFO L93 Difference]: Finished difference Result 28642 states and 47581 transitions. [2019-09-10 09:06:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:06:44,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-09-10 09:06:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:44,892 INFO L225 Difference]: With dead ends: 28642 [2019-09-10 09:06:44,892 INFO L226 Difference]: Without dead ends: 28642 [2019-09-10 09:06:44,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:06:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28642 states. [2019-09-10 09:06:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28642 to 21620. [2019-09-10 09:06:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-09-10 09:06:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 35914 transitions. [2019-09-10 09:06:45,221 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 35914 transitions. Word has length 403 [2019-09-10 09:06:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:45,222 INFO L475 AbstractCegarLoop]: Abstraction has 21620 states and 35914 transitions. [2019-09-10 09:06:45,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:06:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 35914 transitions. [2019-09-10 09:06:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:06:45,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:45,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:45,237 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash 891518200, now seen corresponding path program 1 times [2019-09-10 09:06:45,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:45,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:45,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:45,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:45,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:45,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:45,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:45,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:45,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:45,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:45,790 INFO L87 Difference]: Start difference. First operand 21620 states and 35914 transitions. Second operand 3 states. [2019-09-10 09:06:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:45,885 INFO L93 Difference]: Finished difference Result 11266 states and 18696 transitions. [2019-09-10 09:06:45,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:45,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-09-10 09:06:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:45,910 INFO L225 Difference]: With dead ends: 11266 [2019-09-10 09:06:45,910 INFO L226 Difference]: Without dead ends: 11266 [2019-09-10 09:06:45,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states. [2019-09-10 09:06:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 11264. [2019-09-10 09:06:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11264 states. [2019-09-10 09:06:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11264 states to 11264 states and 18695 transitions. [2019-09-10 09:06:46,069 INFO L78 Accepts]: Start accepts. Automaton has 11264 states and 18695 transitions. Word has length 403 [2019-09-10 09:06:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:46,070 INFO L475 AbstractCegarLoop]: Abstraction has 11264 states and 18695 transitions. [2019-09-10 09:06:46,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 11264 states and 18695 transitions. [2019-09-10 09:06:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:06:46,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:46,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:46,080 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1820126482, now seen corresponding path program 1 times [2019-09-10 09:06:46,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:46,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:46,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:47,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:47,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:47,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:47,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:47,069 INFO L87 Difference]: Start difference. First operand 11264 states and 18695 transitions. Second operand 3 states. [2019-09-10 09:06:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:47,179 INFO L93 Difference]: Finished difference Result 18422 states and 30614 transitions. [2019-09-10 09:06:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:47,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-09-10 09:06:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:47,210 INFO L225 Difference]: With dead ends: 18422 [2019-09-10 09:06:47,211 INFO L226 Difference]: Without dead ends: 18422 [2019-09-10 09:06:47,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18422 states. [2019-09-10 09:06:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18422 to 17696. [2019-09-10 09:06:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17696 states. [2019-09-10 09:06:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17696 states to 17696 states and 29321 transitions. [2019-09-10 09:06:47,449 INFO L78 Accepts]: Start accepts. Automaton has 17696 states and 29321 transitions. Word has length 403 [2019-09-10 09:06:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:47,450 INFO L475 AbstractCegarLoop]: Abstraction has 17696 states and 29321 transitions. [2019-09-10 09:06:47,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 17696 states and 29321 transitions. [2019-09-10 09:06:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:06:47,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:47,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:47,460 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:47,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:47,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2144362799, now seen corresponding path program 1 times [2019-09-10 09:06:47,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:47,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:47,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:48,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:48,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:06:48,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:48,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:06:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:06:48,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:06:48,168 INFO L87 Difference]: Start difference. First operand 17696 states and 29321 transitions. Second operand 6 states. [2019-09-10 09:06:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:48,731 INFO L93 Difference]: Finished difference Result 41412 states and 68589 transitions. [2019-09-10 09:06:48,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:06:48,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-10 09:06:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:48,929 INFO L225 Difference]: With dead ends: 41412 [2019-09-10 09:06:48,929 INFO L226 Difference]: Without dead ends: 41412 [2019-09-10 09:06:48,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:06:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41412 states. [2019-09-10 09:06:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41412 to 39798. [2019-09-10 09:06:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39798 states. [2019-09-10 09:06:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39798 states to 39798 states and 65994 transitions. [2019-09-10 09:06:49,418 INFO L78 Accepts]: Start accepts. Automaton has 39798 states and 65994 transitions. Word has length 403 [2019-09-10 09:06:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:49,419 INFO L475 AbstractCegarLoop]: Abstraction has 39798 states and 65994 transitions. [2019-09-10 09:06:49,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:06:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 39798 states and 65994 transitions. [2019-09-10 09:06:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:06:49,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:49,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:49,426 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1681072861, now seen corresponding path program 1 times [2019-09-10 09:06:49,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:49,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:49,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:49,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:49,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:06:50,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:50,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:06:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:06:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:06:50,083 INFO L87 Difference]: Start difference. First operand 39798 states and 65994 transitions. Second operand 6 states. [2019-09-10 09:06:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:50,569 INFO L93 Difference]: Finished difference Result 67394 states and 111611 transitions. [2019-09-10 09:06:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:06:50,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-10 09:06:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:50,652 INFO L225 Difference]: With dead ends: 67394 [2019-09-10 09:06:50,652 INFO L226 Difference]: Without dead ends: 67394 [2019-09-10 09:06:50,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:06:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67394 states. [2019-09-10 09:06:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67394 to 66124. [2019-09-10 09:06:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66124 states. [2019-09-10 09:06:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66124 states to 66124 states and 109696 transitions. [2019-09-10 09:06:52,398 INFO L78 Accepts]: Start accepts. Automaton has 66124 states and 109696 transitions. Word has length 403 [2019-09-10 09:06:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:52,399 INFO L475 AbstractCegarLoop]: Abstraction has 66124 states and 109696 transitions. [2019-09-10 09:06:52,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:06:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 66124 states and 109696 transitions. [2019-09-10 09:06:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:06:52,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:52,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:52,406 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1433351598, now seen corresponding path program 1 times [2019-09-10 09:06:52,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:52,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:52,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:52,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:52,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:52,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 09:06:52,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:52,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:06:52,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:52,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:06:52,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:06:52,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:06:52,833 INFO L87 Difference]: Start difference. First operand 66124 states and 109696 transitions. Second operand 5 states. [2019-09-10 09:06:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:53,491 INFO L93 Difference]: Finished difference Result 173531 states and 287165 transitions. [2019-09-10 09:06:53,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:06:53,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 403 [2019-09-10 09:06:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:53,716 INFO L225 Difference]: With dead ends: 173531 [2019-09-10 09:06:53,716 INFO L226 Difference]: Without dead ends: 173531 [2019-09-10 09:06:53,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:06:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173531 states. [2019-09-10 09:06:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173531 to 151553. [2019-09-10 09:06:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151553 states. [2019-09-10 09:06:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151553 states to 151553 states and 250682 transitions. [2019-09-10 09:06:57,337 INFO L78 Accepts]: Start accepts. Automaton has 151553 states and 250682 transitions. Word has length 403 [2019-09-10 09:06:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:57,338 INFO L475 AbstractCegarLoop]: Abstraction has 151553 states and 250682 transitions. [2019-09-10 09:06:57,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:06:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 151553 states and 250682 transitions. [2019-09-10 09:06:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:06:57,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:57,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:57,347 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1638217178, now seen corresponding path program 1 times [2019-09-10 09:06:57,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:58,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:58,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:06:58,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:58,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:06:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:06:58,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:06:58,612 INFO L87 Difference]: Start difference. First operand 151553 states and 250682 transitions. Second operand 6 states. [2019-09-10 09:06:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:59,602 INFO L93 Difference]: Finished difference Result 212129 states and 350587 transitions. [2019-09-10 09:06:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:06:59,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-10 09:06:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:59,923 INFO L225 Difference]: With dead ends: 212129 [2019-09-10 09:06:59,924 INFO L226 Difference]: Without dead ends: 212129 [2019-09-10 09:06:59,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:07:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212129 states. [2019-09-10 09:07:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212129 to 206815. [2019-09-10 09:07:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206815 states. [2019-09-10 09:07:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206815 states to 206815 states and 342108 transitions. [2019-09-10 09:07:05,066 INFO L78 Accepts]: Start accepts. Automaton has 206815 states and 342108 transitions. Word has length 403 [2019-09-10 09:07:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:05,066 INFO L475 AbstractCegarLoop]: Abstraction has 206815 states and 342108 transitions. [2019-09-10 09:07:05,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:07:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 206815 states and 342108 transitions. [2019-09-10 09:07:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-10 09:07:05,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:05,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:05,075 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2025391198, now seen corresponding path program 1 times [2019-09-10 09:07:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:05,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:05,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:06,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:06,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:06,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:06,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:06,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:06,155 INFO L87 Difference]: Start difference. First operand 206815 states and 342108 transitions. Second operand 3 states. [2019-09-10 09:07:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:07,391 INFO L93 Difference]: Finished difference Result 406855 states and 672001 transitions. [2019-09-10 09:07:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:07,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-09-10 09:07:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:07,958 INFO L225 Difference]: With dead ends: 406855 [2019-09-10 09:07:07,958 INFO L226 Difference]: Without dead ends: 406855 [2019-09-10 09:07:07,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406855 states. [2019-09-10 09:07:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406855 to 406853. [2019-09-10 09:07:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406853 states. [2019-09-10 09:07:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406853 states to 406853 states and 672000 transitions. [2019-09-10 09:07:17,516 INFO L78 Accepts]: Start accepts. Automaton has 406853 states and 672000 transitions. Word has length 403 [2019-09-10 09:07:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:17,517 INFO L475 AbstractCegarLoop]: Abstraction has 406853 states and 672000 transitions. [2019-09-10 09:07:17,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 406853 states and 672000 transitions. [2019-09-10 09:07:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-10 09:07:17,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:17,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:17,531 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:17,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1959806139, now seen corresponding path program 1 times [2019-09-10 09:07:17,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:17,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:17,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:17,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:17,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:17,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:17,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:17,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:17,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:17,781 INFO L87 Difference]: Start difference. First operand 406853 states and 672000 transitions. Second operand 3 states. [2019-09-10 09:07:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:25,620 INFO L93 Difference]: Finished difference Result 802625 states and 1320314 transitions. [2019-09-10 09:07:25,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:25,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-09-10 09:07:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:26,879 INFO L225 Difference]: With dead ends: 802625 [2019-09-10 09:07:26,879 INFO L226 Difference]: Without dead ends: 802625 [2019-09-10 09:07:26,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802625 states. [2019-09-10 09:07:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802625 to 802623. [2019-09-10 09:07:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802623 states. [2019-09-10 09:07:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802623 states to 802623 states and 1320313 transitions. [2019-09-10 09:07:52,667 INFO L78 Accepts]: Start accepts. Automaton has 802623 states and 1320313 transitions. Word has length 404 [2019-09-10 09:07:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:52,668 INFO L475 AbstractCegarLoop]: Abstraction has 802623 states and 1320313 transitions. [2019-09-10 09:07:52,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 802623 states and 1320313 transitions. [2019-09-10 09:07:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-10 09:07:52,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:52,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:52,683 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash 879620933, now seen corresponding path program 1 times [2019-09-10 09:07:52,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:52,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:52,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:52,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:52,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:54,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:54,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:54,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:54,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:54,616 INFO L87 Difference]: Start difference. First operand 802623 states and 1320313 transitions. Second operand 3 states. [2019-09-10 09:08:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:08,026 INFO L93 Difference]: Finished difference Result 1584159 states and 2595126 transitions. [2019-09-10 09:08:08,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:08,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-09-10 09:08:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:19,820 INFO L225 Difference]: With dead ends: 1584159 [2019-09-10 09:08:19,820 INFO L226 Difference]: Without dead ends: 1584159 [2019-09-10 09:08:19,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584159 states. [2019-09-10 09:08:52,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584159 to 1584157. [2019-09-10 09:08:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584157 states. [2019-09-10 09:09:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584157 states to 1584157 states and 2595125 transitions. [2019-09-10 09:09:14,587 INFO L78 Accepts]: Start accepts. Automaton has 1584157 states and 2595125 transitions. Word has length 404 [2019-09-10 09:09:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:14,588 INFO L475 AbstractCegarLoop]: Abstraction has 1584157 states and 2595125 transitions. [2019-09-10 09:09:14,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:09:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1584157 states and 2595125 transitions. [2019-09-10 09:09:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-10 09:09:14,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:14,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:09:14,608 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1734452495, now seen corresponding path program 1 times [2019-09-10 09:09:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:14,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:14,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:09:14,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:14,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:09:14,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:14,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:09:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:09:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:09:14,952 INFO L87 Difference]: Start difference. First operand 1584157 states and 2595125 transitions. Second operand 3 states. [2019-09-10 09:09:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:52,306 INFO L93 Difference]: Finished difference Result 3126562 states and 5100107 transitions. [2019-09-10 09:09:52,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:09:52,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-09-10 09:09:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:58,028 INFO L225 Difference]: With dead ends: 3126562 [2019-09-10 09:09:58,028 INFO L226 Difference]: Without dead ends: 3126562 [2019-09-10 09:09:58,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:10:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126562 states.