java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:08:13,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:08:13,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:08:13,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:08:13,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:08:13,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:08:13,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:08:13,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:08:13,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:08:13,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:08:13,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:08:13,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:08:13,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:08:13,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:08:13,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:08:13,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:08:13,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:08:13,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:08:13,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:08:13,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:08:13,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:08:13,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:08:13,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:08:13,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:08:13,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:08:13,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:08:13,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:08:13,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:08:13,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:08:13,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:08:13,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:08:13,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:08:13,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:08:13,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:08:13,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:08:13,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:08:13,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:08:13,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:08:13,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:08:13,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:08:13,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:08:13,267 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-10-03 03:08:13,282 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:08:13,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:08:13,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:08:13,282 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:08:13,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:08:13,283 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:08:13,284 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:08:13,284 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:08:13,284 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:08:13,284 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:08:13,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:08:13,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:08:13,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:08:13,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:08:13,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:08:13,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:08:13,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:08:13,286 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:08:13,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:08:13,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:08:13,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:08:13,287 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:08:13,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:08:13,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:08:13,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:08:13,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:08:13,288 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:08:13,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:08:13,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:08:13,289 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:08:13,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:08:13,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:08:13,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:08:13,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:08:13,335 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:08:13,336 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-03 03:08:13,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90efc1c3/0b00ae73074e4aceb774d3747784358d/FLAG163850fec [2019-10-03 03:08:13,963 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:08:13,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-03 03:08:13,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90efc1c3/0b00ae73074e4aceb774d3747784358d/FLAG163850fec [2019-10-03 03:08:14,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90efc1c3/0b00ae73074e4aceb774d3747784358d [2019-10-03 03:08:14,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:08:14,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:08:14,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:08:14,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:08:14,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:08:14,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528d6d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14, skipping insertion in model container [2019-10-03 03:08:14,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,332 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:08:14,397 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:08:14,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:08:14,822 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:08:14,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:08:14,926 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:08:14,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14 WrapperNode [2019-10-03 03:08:14,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:08:14,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:08:14,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:08:14,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:08:14,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (1/1) ... [2019-10-03 03:08:14,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:08:15,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:08:15,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:08:15,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:08:15,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (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-10-03 03:08:15,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:08:15,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:08:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-03 03:08:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-03 03:08:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-03 03:08:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-03 03:08:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-03 03:08:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-03 03:08:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-03 03:08:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-03 03:08:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-03 03:08:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-03 03:08:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-03 03:08:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-03 03:08:15,072 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-03 03:08:15,072 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-03 03:08:15,072 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-03 03:08:15,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:08:15,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-03 03:08:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:08:15,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:08:15,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:08:15,073 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:08:15,073 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:08:15,073 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:08:15,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:08:15,074 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-03 03:08:15,074 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-03 03:08:15,074 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-03 03:08:15,074 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-03 03:08:15,074 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-03 03:08:15,074 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-03 03:08:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-03 03:08:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-03 03:08:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:08:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-03 03:08:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-03 03:08:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-03 03:08:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-03 03:08:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-03 03:08:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:08:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:08:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:08:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:08:15,952 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:08:15,952 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 03:08:15,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:08:15 BoogieIcfgContainer [2019-10-03 03:08:15,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:08:15,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:08:15,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:08:15,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:08:15,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:08:14" (1/3) ... [2019-10-03 03:08:15,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285eb3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:08:15, skipping insertion in model container [2019-10-03 03:08:15,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:14" (2/3) ... [2019-10-03 03:08:15,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285eb3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:08:15, skipping insertion in model container [2019-10-03 03:08:15,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:08:15" (3/3) ... [2019-10-03 03:08:15,966 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-03 03:08:15,977 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:08:15,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 03:08:16,003 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 03:08:16,027 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:08:16,027 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:08:16,027 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:08:16,028 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:08:16,028 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:08:16,028 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:08:16,028 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:08:16,029 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:08:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states. [2019-10-03 03:08:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 03:08:16,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:16,068 INFO L411 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] [2019-10-03 03:08:16,070 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1914592099, now seen corresponding path program 1 times [2019-10-03 03:08:16,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:16,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:16,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:16,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:16,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:16,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:16,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:16,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:16,594 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 4 states. [2019-10-03 03:08:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:16,690 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2019-10-03 03:08:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:16,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-03 03:08:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:16,708 INFO L225 Difference]: With dead ends: 232 [2019-10-03 03:08:16,708 INFO L226 Difference]: Without dead ends: 229 [2019-10-03 03:08:16,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-03 03:08:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-10-03 03:08:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-03 03:08:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions. [2019-10-03 03:08:16,776 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 65 [2019-10-03 03:08:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:16,777 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 319 transitions. [2019-10-03 03:08:16,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions. [2019-10-03 03:08:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 03:08:16,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:16,781 INFO L411 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] [2019-10-03 03:08:16,782 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2098614595, now seen corresponding path program 1 times [2019-10-03 03:08:16,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:16,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:16,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:16,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:16,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:16,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:16,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:16,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:16,998 INFO L87 Difference]: Start difference. First operand 229 states and 319 transitions. Second operand 4 states. [2019-10-03 03:08:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:17,084 INFO L93 Difference]: Finished difference Result 233 states and 322 transitions. [2019-10-03 03:08:17,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:17,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-03 03:08:17,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:17,090 INFO L225 Difference]: With dead ends: 233 [2019-10-03 03:08:17,090 INFO L226 Difference]: Without dead ends: 233 [2019-10-03 03:08:17,091 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 03:08:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-03 03:08:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-10-03 03:08:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-03 03:08:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 322 transitions. [2019-10-03 03:08:17,116 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 322 transitions. Word has length 76 [2019-10-03 03:08:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:17,116 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-10-03 03:08:17,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 322 transitions. [2019-10-03 03:08:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:08:17,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:17,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:17,121 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1135646998, now seen corresponding path program 1 times [2019-10-03 03:08:17,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:17,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:17,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:17,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:17,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:17,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:17,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:08:17,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:17,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:08:17,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:08:17,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:08:17,334 INFO L87 Difference]: Start difference. First operand 233 states and 322 transitions. Second operand 7 states. [2019-10-03 03:08:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:18,706 INFO L93 Difference]: Finished difference Result 320 states and 435 transitions. [2019-10-03 03:08:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:08:18,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-03 03:08:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:18,715 INFO L225 Difference]: With dead ends: 320 [2019-10-03 03:08:18,716 INFO L226 Difference]: Without dead ends: 320 [2019-10-03 03:08:18,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:08:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-03 03:08:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-10-03 03:08:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-03 03:08:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 434 transitions. [2019-10-03 03:08:18,745 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 434 transitions. Word has length 94 [2019-10-03 03:08:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:18,749 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 434 transitions. [2019-10-03 03:08:18,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:08:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 434 transitions. [2019-10-03 03:08:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:08:18,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:18,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:18,754 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash -376916963, now seen corresponding path program 1 times [2019-10-03 03:08:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:18,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:18,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:18,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:18,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:18,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:18,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:08:18,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:18,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:08:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:08:18,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:08:18,900 INFO L87 Difference]: Start difference. First operand 319 states and 434 transitions. Second operand 7 states. [2019-10-03 03:08:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:20,230 INFO L93 Difference]: Finished difference Result 323 states and 439 transitions. [2019-10-03 03:08:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:08:20,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-03 03:08:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:20,235 INFO L225 Difference]: With dead ends: 323 [2019-10-03 03:08:20,235 INFO L226 Difference]: Without dead ends: 323 [2019-10-03 03:08:20,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:08:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-03 03:08:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-10-03 03:08:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-03 03:08:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 434 transitions. [2019-10-03 03:08:20,256 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 434 transitions. Word has length 95 [2019-10-03 03:08:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:20,257 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 434 transitions. [2019-10-03 03:08:20,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:08:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 434 transitions. [2019-10-03 03:08:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:08:20,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:20,259 INFO L411 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] [2019-10-03 03:08:20,260 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:20,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:20,260 INFO L82 PathProgramCache]: Analyzing trace with hash 121472215, now seen corresponding path program 1 times [2019-10-03 03:08:20,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:20,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:20,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:20,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:20,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:20,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:20,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:08:20,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:20,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:08:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:08:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:08:20,342 INFO L87 Difference]: Start difference. First operand 319 states and 434 transitions. Second operand 3 states. [2019-10-03 03:08:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:20,376 INFO L93 Difference]: Finished difference Result 550 states and 757 transitions. [2019-10-03 03:08:20,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:08:20,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-03 03:08:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:20,382 INFO L225 Difference]: With dead ends: 550 [2019-10-03 03:08:20,382 INFO L226 Difference]: Without dead ends: 550 [2019-10-03 03:08:20,383 INFO L640 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-10-03 03:08:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-03 03:08:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2019-10-03 03:08:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-03 03:08:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 737 transitions. [2019-10-03 03:08:20,417 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 737 transitions. Word has length 96 [2019-10-03 03:08:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:20,417 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 737 transitions. [2019-10-03 03:08:20,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:08:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 737 transitions. [2019-10-03 03:08:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:08:20,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:20,423 INFO L411 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] [2019-10-03 03:08:20,428 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1774390923, now seen corresponding path program 1 times [2019-10-03 03:08:20,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:20,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:20,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:20,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:20,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:20,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:20,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:08:20,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:20,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:08:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:08:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:08:20,515 INFO L87 Difference]: Start difference. First operand 533 states and 737 transitions. Second operand 3 states. [2019-10-03 03:08:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:20,565 INFO L93 Difference]: Finished difference Result 881 states and 1237 transitions. [2019-10-03 03:08:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:08:20,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-03 03:08:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:20,575 INFO L225 Difference]: With dead ends: 881 [2019-10-03 03:08:20,575 INFO L226 Difference]: Without dead ends: 881 [2019-10-03 03:08:20,576 INFO L640 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-10-03 03:08:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-10-03 03:08:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 875. [2019-10-03 03:08:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-10-03 03:08:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1228 transitions. [2019-10-03 03:08:20,639 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1228 transitions. Word has length 97 [2019-10-03 03:08:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:20,641 INFO L475 AbstractCegarLoop]: Abstraction has 875 states and 1228 transitions. [2019-10-03 03:08:20,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:08:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1228 transitions. [2019-10-03 03:08:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:08:20,644 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:20,645 INFO L411 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] [2019-10-03 03:08:20,645 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1073326345, now seen corresponding path program 1 times [2019-10-03 03:08:20,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:20,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:20,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:20,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:08:20,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:20,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:08:20,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:08:20,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:08:20,769 INFO L87 Difference]: Start difference. First operand 875 states and 1228 transitions. Second operand 3 states. [2019-10-03 03:08:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:20,795 INFO L93 Difference]: Finished difference Result 766 states and 1055 transitions. [2019-10-03 03:08:20,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:08:20,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-03 03:08:20,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:20,802 INFO L225 Difference]: With dead ends: 766 [2019-10-03 03:08:20,802 INFO L226 Difference]: Without dead ends: 716 [2019-10-03 03:08:20,803 INFO L640 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-10-03 03:08:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-10-03 03:08:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-10-03 03:08:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-10-03 03:08:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 996 transitions. [2019-10-03 03:08:20,841 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 996 transitions. Word has length 97 [2019-10-03 03:08:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:20,841 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 996 transitions. [2019-10-03 03:08:20,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:08:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 996 transitions. [2019-10-03 03:08:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:08:20,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:20,846 INFO L411 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] [2019-10-03 03:08:20,846 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:20,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1721002108, now seen corresponding path program 1 times [2019-10-03 03:08:20,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:20,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:20,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:20,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:20,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:20,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:20,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:20,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:20,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:20,993 INFO L87 Difference]: Start difference. First operand 716 states and 996 transitions. Second operand 4 states. [2019-10-03 03:08:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:21,029 INFO L93 Difference]: Finished difference Result 731 states and 1008 transitions. [2019-10-03 03:08:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:21,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-03 03:08:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:21,035 INFO L225 Difference]: With dead ends: 731 [2019-10-03 03:08:21,035 INFO L226 Difference]: Without dead ends: 731 [2019-10-03 03:08:21,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-03 03:08:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-03 03:08:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-03 03:08:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1008 transitions. [2019-10-03 03:08:21,065 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1008 transitions. Word has length 97 [2019-10-03 03:08:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:21,066 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1008 transitions. [2019-10-03 03:08:21,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1008 transitions. [2019-10-03 03:08:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 03:08:21,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:21,068 INFO L411 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] [2019-10-03 03:08:21,068 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash 190055260, now seen corresponding path program 1 times [2019-10-03 03:08:21,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:21,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:21,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:21,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:21,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:21,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:21,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:21,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:21,157 INFO L87 Difference]: Start difference. First operand 731 states and 1008 transitions. Second operand 4 states. [2019-10-03 03:08:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:21,221 INFO L93 Difference]: Finished difference Result 746 states and 1020 transitions. [2019-10-03 03:08:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:21,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-03 03:08:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:21,228 INFO L225 Difference]: With dead ends: 746 [2019-10-03 03:08:21,228 INFO L226 Difference]: Without dead ends: 746 [2019-10-03 03:08:21,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-03 03:08:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2019-10-03 03:08:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-03 03:08:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1020 transitions. [2019-10-03 03:08:21,265 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1020 transitions. Word has length 105 [2019-10-03 03:08:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:21,265 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1020 transitions. [2019-10-03 03:08:21,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1020 transitions. [2019-10-03 03:08:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:08:21,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:21,268 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:21,268 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash 338939110, now seen corresponding path program 1 times [2019-10-03 03:08:21,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:21,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:21,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:21,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:21,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:21,382 INFO L87 Difference]: Start difference. First operand 746 states and 1020 transitions. Second operand 4 states. [2019-10-03 03:08:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:21,436 INFO L93 Difference]: Finished difference Result 758 states and 1029 transitions. [2019-10-03 03:08:21,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:21,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-03 03:08:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:21,442 INFO L225 Difference]: With dead ends: 758 [2019-10-03 03:08:21,442 INFO L226 Difference]: Without dead ends: 758 [2019-10-03 03:08:21,443 INFO L640 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-10-03 03:08:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-10-03 03:08:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2019-10-03 03:08:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-10-03 03:08:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1029 transitions. [2019-10-03 03:08:21,485 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1029 transitions. Word has length 113 [2019-10-03 03:08:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:21,486 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 1029 transitions. [2019-10-03 03:08:21,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1029 transitions. [2019-10-03 03:08:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:08:21,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:21,489 INFO L411 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] [2019-10-03 03:08:21,489 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash 462889986, now seen corresponding path program 1 times [2019-10-03 03:08:21,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:21,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:21,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:21,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:21,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:21,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:21,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:21,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:21,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:21,605 INFO L87 Difference]: Start difference. First operand 758 states and 1029 transitions. Second operand 4 states. [2019-10-03 03:08:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:21,669 INFO L93 Difference]: Finished difference Result 773 states and 1041 transitions. [2019-10-03 03:08:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:21,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-03 03:08:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:21,677 INFO L225 Difference]: With dead ends: 773 [2019-10-03 03:08:21,677 INFO L226 Difference]: Without dead ends: 773 [2019-10-03 03:08:21,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-03 03:08:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2019-10-03 03:08:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-03 03:08:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1041 transitions. [2019-10-03 03:08:21,717 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1041 transitions. Word has length 113 [2019-10-03 03:08:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:21,718 INFO L475 AbstractCegarLoop]: Abstraction has 773 states and 1041 transitions. [2019-10-03 03:08:21,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1041 transitions. [2019-10-03 03:08:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 03:08:21,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:21,721 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:21,722 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:21,722 INFO L82 PathProgramCache]: Analyzing trace with hash 397660294, now seen corresponding path program 1 times [2019-10-03 03:08:21,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:21,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:21,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:08:21,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:21,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:21,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:21,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:21,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:21,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:21,877 INFO L87 Difference]: Start difference. First operand 773 states and 1041 transitions. Second operand 4 states. [2019-10-03 03:08:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:21,919 INFO L93 Difference]: Finished difference Result 791 states and 1056 transitions. [2019-10-03 03:08:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:21,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-03 03:08:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:21,924 INFO L225 Difference]: With dead ends: 791 [2019-10-03 03:08:21,924 INFO L226 Difference]: Without dead ends: 791 [2019-10-03 03:08:21,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-03 03:08:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2019-10-03 03:08:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-03 03:08:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1056 transitions. [2019-10-03 03:08:21,955 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1056 transitions. Word has length 121 [2019-10-03 03:08:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:21,956 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1056 transitions. [2019-10-03 03:08:21,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1056 transitions. [2019-10-03 03:08:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-03 03:08:21,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:21,960 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:21,960 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1636035475, now seen corresponding path program 1 times [2019-10-03 03:08:21,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:21,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:21,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:21,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 03:08:22,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:22,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:08:22,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:22,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:08:22,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:08:22,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:08:22,176 INFO L87 Difference]: Start difference. First operand 791 states and 1056 transitions. Second operand 10 states. [2019-10-03 03:08:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:25,108 INFO L93 Difference]: Finished difference Result 1425 states and 1863 transitions. [2019-10-03 03:08:25,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 03:08:25,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-10-03 03:08:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:25,117 INFO L225 Difference]: With dead ends: 1425 [2019-10-03 03:08:25,117 INFO L226 Difference]: Without dead ends: 1416 [2019-10-03 03:08:25,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:08:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-10-03 03:08:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1323. [2019-10-03 03:08:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-10-03 03:08:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1734 transitions. [2019-10-03 03:08:25,172 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1734 transitions. Word has length 126 [2019-10-03 03:08:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:25,173 INFO L475 AbstractCegarLoop]: Abstraction has 1323 states and 1734 transitions. [2019-10-03 03:08:25,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:08:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1734 transitions. [2019-10-03 03:08:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 03:08:25,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:25,175 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:25,176 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229945, now seen corresponding path program 1 times [2019-10-03 03:08:25,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:25,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:25,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 03:08:25,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:25,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:25,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:25,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:25,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:25,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:25,286 INFO L87 Difference]: Start difference. First operand 1323 states and 1734 transitions. Second operand 4 states. [2019-10-03 03:08:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:25,326 INFO L93 Difference]: Finished difference Result 1335 states and 1728 transitions. [2019-10-03 03:08:25,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:25,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-03 03:08:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:25,335 INFO L225 Difference]: With dead ends: 1335 [2019-10-03 03:08:25,335 INFO L226 Difference]: Without dead ends: 1335 [2019-10-03 03:08:25,336 INFO L640 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-10-03 03:08:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-03 03:08:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1329. [2019-10-03 03:08:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-10-03 03:08:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1721 transitions. [2019-10-03 03:08:25,384 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1721 transitions. Word has length 128 [2019-10-03 03:08:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:25,385 INFO L475 AbstractCegarLoop]: Abstraction has 1329 states and 1721 transitions. [2019-10-03 03:08:25,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1721 transitions. [2019-10-03 03:08:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-03 03:08:25,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:25,387 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:25,388 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash -287290418, now seen corresponding path program 1 times [2019-10-03 03:08:25,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:25,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:25,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:25,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 03:08:25,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:25,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:08:25,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:25,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:08:25,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:08:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:08:25,567 INFO L87 Difference]: Start difference. First operand 1329 states and 1721 transitions. Second operand 9 states. [2019-10-03 03:08:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:27,630 INFO L93 Difference]: Finished difference Result 1713 states and 2187 transitions. [2019-10-03 03:08:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:08:27,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-10-03 03:08:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:27,644 INFO L225 Difference]: With dead ends: 1713 [2019-10-03 03:08:27,644 INFO L226 Difference]: Without dead ends: 1713 [2019-10-03 03:08:27,647 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:08:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2019-10-03 03:08:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1452. [2019-10-03 03:08:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-10-03 03:08:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1855 transitions. [2019-10-03 03:08:27,724 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1855 transitions. Word has length 130 [2019-10-03 03:08:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:27,725 INFO L475 AbstractCegarLoop]: Abstraction has 1452 states and 1855 transitions. [2019-10-03 03:08:27,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:08:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1855 transitions. [2019-10-03 03:08:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-03 03:08:27,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:27,729 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:27,729 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash 99662188, now seen corresponding path program 1 times [2019-10-03 03:08:27,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:27,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:27,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:27,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:08:27,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:27,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:08:27,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:27,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:08:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:08:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:08:27,867 INFO L87 Difference]: Start difference. First operand 1452 states and 1855 transitions. Second operand 7 states. [2019-10-03 03:08:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:27,955 INFO L93 Difference]: Finished difference Result 1549 states and 1987 transitions. [2019-10-03 03:08:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:08:27,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-03 03:08:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:27,963 INFO L225 Difference]: With dead ends: 1549 [2019-10-03 03:08:27,964 INFO L226 Difference]: Without dead ends: 1549 [2019-10-03 03:08:27,964 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:08:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2019-10-03 03:08:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1473. [2019-10-03 03:08:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-10-03 03:08:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1878 transitions. [2019-10-03 03:08:28,018 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1878 transitions. Word has length 129 [2019-10-03 03:08:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:28,019 INFO L475 AbstractCegarLoop]: Abstraction has 1473 states and 1878 transitions. [2019-10-03 03:08:28,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:08:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1878 transitions. [2019-10-03 03:08:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 03:08:28,021 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:28,021 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:28,021 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:28,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash -563839625, now seen corresponding path program 1 times [2019-10-03 03:08:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:28,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:28,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:08:28,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:28,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:08:28,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:28,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:08:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:08:28,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:08:28,301 INFO L87 Difference]: Start difference. First operand 1473 states and 1878 transitions. Second operand 10 states. [2019-10-03 03:08:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:31,860 INFO L93 Difference]: Finished difference Result 2741 states and 3467 transitions. [2019-10-03 03:08:31,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 03:08:31,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2019-10-03 03:08:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:31,875 INFO L225 Difference]: With dead ends: 2741 [2019-10-03 03:08:31,875 INFO L226 Difference]: Without dead ends: 2741 [2019-10-03 03:08:31,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:08:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2019-10-03 03:08:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1898. [2019-10-03 03:08:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-10-03 03:08:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2408 transitions. [2019-10-03 03:08:31,956 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2408 transitions. Word has length 134 [2019-10-03 03:08:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:31,957 INFO L475 AbstractCegarLoop]: Abstraction has 1898 states and 2408 transitions. [2019-10-03 03:08:31,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:08:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2408 transitions. [2019-10-03 03:08:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 03:08:31,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:31,959 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:31,960 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1781848955, now seen corresponding path program 1 times [2019-10-03 03:08:31,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:31,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:31,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:31,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:32,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:32,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:08:32,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:32,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:08:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:08:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:32,058 INFO L87 Difference]: Start difference. First operand 1898 states and 2408 transitions. Second operand 5 states. [2019-10-03 03:08:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:32,403 INFO L93 Difference]: Finished difference Result 4960 states and 6308 transitions. [2019-10-03 03:08:32,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 03:08:32,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-03 03:08:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:32,429 INFO L225 Difference]: With dead ends: 4960 [2019-10-03 03:08:32,429 INFO L226 Difference]: Without dead ends: 4960 [2019-10-03 03:08:32,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:08:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2019-10-03 03:08:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4504. [2019-10-03 03:08:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2019-10-03 03:08:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 5734 transitions. [2019-10-03 03:08:32,574 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 5734 transitions. Word has length 135 [2019-10-03 03:08:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:32,574 INFO L475 AbstractCegarLoop]: Abstraction has 4504 states and 5734 transitions. [2019-10-03 03:08:32,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:08:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 5734 transitions. [2019-10-03 03:08:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 03:08:32,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:32,578 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:32,578 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:32,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1847941033, now seen corresponding path program 1 times [2019-10-03 03:08:32,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:32,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:32,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:32,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:32,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:32,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:32,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:32,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:32,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:32,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:32,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:32,744 INFO L87 Difference]: Start difference. First operand 4504 states and 5734 transitions. Second operand 4 states. [2019-10-03 03:08:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:33,029 INFO L93 Difference]: Finished difference Result 4541 states and 5745 transitions. [2019-10-03 03:08:33,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:33,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-03 03:08:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:33,057 INFO L225 Difference]: With dead ends: 4541 [2019-10-03 03:08:33,057 INFO L226 Difference]: Without dead ends: 4541 [2019-10-03 03:08:33,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2019-10-03 03:08:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 4122. [2019-10-03 03:08:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4122 states. [2019-10-03 03:08:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 5249 transitions. [2019-10-03 03:08:33,178 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 5249 transitions. Word has length 139 [2019-10-03 03:08:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:33,180 INFO L475 AbstractCegarLoop]: Abstraction has 4122 states and 5249 transitions. [2019-10-03 03:08:33,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 5249 transitions. [2019-10-03 03:08:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 03:08:33,183 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:33,184 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:33,184 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1695535937, now seen corresponding path program 1 times [2019-10-03 03:08:33,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:33,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:33,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:33,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:08:33,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:33,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:08:33,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:33,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:08:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:08:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:08:33,373 INFO L87 Difference]: Start difference. First operand 4122 states and 5249 transitions. Second operand 9 states. [2019-10-03 03:08:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:34,696 INFO L93 Difference]: Finished difference Result 3839 states and 4911 transitions. [2019-10-03 03:08:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:08:34,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-03 03:08:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:34,727 INFO L225 Difference]: With dead ends: 3839 [2019-10-03 03:08:34,727 INFO L226 Difference]: Without dead ends: 3839 [2019-10-03 03:08:34,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:08:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2019-10-03 03:08:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3482. [2019-10-03 03:08:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2019-10-03 03:08:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 4424 transitions. [2019-10-03 03:08:34,818 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 4424 transitions. Word has length 136 [2019-10-03 03:08:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:34,818 INFO L475 AbstractCegarLoop]: Abstraction has 3482 states and 4424 transitions. [2019-10-03 03:08:34,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:08:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 4424 transitions. [2019-10-03 03:08:34,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 03:08:34,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:34,863 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:34,863 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1308999803, now seen corresponding path program 1 times [2019-10-03 03:08:34,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:34,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:34,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:34,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:34,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:08:35,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:35,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:08:35,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:35,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:08:35,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:08:35,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:08:35,013 INFO L87 Difference]: Start difference. First operand 3482 states and 4424 transitions. Second operand 9 states. [2019-10-03 03:08:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:36,595 INFO L93 Difference]: Finished difference Result 3943 states and 5094 transitions. [2019-10-03 03:08:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 03:08:36,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-03 03:08:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:36,613 INFO L225 Difference]: With dead ends: 3943 [2019-10-03 03:08:36,613 INFO L226 Difference]: Without dead ends: 3943 [2019-10-03 03:08:36,614 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-03 03:08:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2019-10-03 03:08:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3381. [2019-10-03 03:08:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3381 states. [2019-10-03 03:08:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4295 transitions. [2019-10-03 03:08:36,693 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4295 transitions. Word has length 137 [2019-10-03 03:08:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:36,694 INFO L475 AbstractCegarLoop]: Abstraction has 3381 states and 4295 transitions. [2019-10-03 03:08:36,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:08:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4295 transitions. [2019-10-03 03:08:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 03:08:36,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:36,697 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:36,697 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1491067408, now seen corresponding path program 1 times [2019-10-03 03:08:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:36,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:36,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:36,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:08:36,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:36,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:08:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:08:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:36,776 INFO L87 Difference]: Start difference. First operand 3381 states and 4295 transitions. Second operand 5 states. [2019-10-03 03:08:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:37,189 INFO L93 Difference]: Finished difference Result 7541 states and 9616 transitions. [2019-10-03 03:08:37,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 03:08:37,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-03 03:08:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:37,241 INFO L225 Difference]: With dead ends: 7541 [2019-10-03 03:08:37,241 INFO L226 Difference]: Without dead ends: 7541 [2019-10-03 03:08:37,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:08:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7541 states. [2019-10-03 03:08:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7541 to 5188. [2019-10-03 03:08:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-10-03 03:08:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 6581 transitions. [2019-10-03 03:08:37,380 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 6581 transitions. Word has length 138 [2019-10-03 03:08:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:37,381 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 6581 transitions. [2019-10-03 03:08:37,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:08:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 6581 transitions. [2019-10-03 03:08:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 03:08:37,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:37,387 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:37,388 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:37,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1745801643, now seen corresponding path program 1 times [2019-10-03 03:08:37,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:37,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:37,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:37,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:37,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:37,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:37,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:08:37,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:37,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:08:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:08:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:37,464 INFO L87 Difference]: Start difference. First operand 5188 states and 6581 transitions. Second operand 5 states. [2019-10-03 03:08:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:37,840 INFO L93 Difference]: Finished difference Result 7495 states and 9466 transitions. [2019-10-03 03:08:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 03:08:37,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-03 03:08:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:37,862 INFO L225 Difference]: With dead ends: 7495 [2019-10-03 03:08:37,862 INFO L226 Difference]: Without dead ends: 7495 [2019-10-03 03:08:37,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:08:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7495 states. [2019-10-03 03:08:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7495 to 6951. [2019-10-03 03:08:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6951 states. [2019-10-03 03:08:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6951 states to 6951 states and 8771 transitions. [2019-10-03 03:08:38,005 INFO L78 Accepts]: Start accepts. Automaton has 6951 states and 8771 transitions. Word has length 138 [2019-10-03 03:08:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:38,005 INFO L475 AbstractCegarLoop]: Abstraction has 6951 states and 8771 transitions. [2019-10-03 03:08:38,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:08:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 6951 states and 8771 transitions. [2019-10-03 03:08:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 03:08:38,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:38,010 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:38,010 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:38,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:38,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1645561488, now seen corresponding path program 1 times [2019-10-03 03:08:38,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:38,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:38,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:38,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:38,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:38,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:38,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:08:38,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:38,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:08:38,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:08:38,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:08:38,066 INFO L87 Difference]: Start difference. First operand 6951 states and 8771 transitions. Second operand 3 states. [2019-10-03 03:08:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:38,157 INFO L93 Difference]: Finished difference Result 7020 states and 8876 transitions. [2019-10-03 03:08:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:08:38,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-03 03:08:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:38,178 INFO L225 Difference]: With dead ends: 7020 [2019-10-03 03:08:38,178 INFO L226 Difference]: Without dead ends: 7020 [2019-10-03 03:08:38,179 INFO L640 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-10-03 03:08:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7020 states. [2019-10-03 03:08:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7020 to 6957. [2019-10-03 03:08:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6957 states. [2019-10-03 03:08:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6957 states to 6957 states and 8777 transitions. [2019-10-03 03:08:38,343 INFO L78 Accepts]: Start accepts. Automaton has 6957 states and 8777 transitions. Word has length 139 [2019-10-03 03:08:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:38,344 INFO L475 AbstractCegarLoop]: Abstraction has 6957 states and 8777 transitions. [2019-10-03 03:08:38,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:08:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 6957 states and 8777 transitions. [2019-10-03 03:08:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 03:08:38,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:38,349 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:38,349 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1802829423, now seen corresponding path program 1 times [2019-10-03 03:08:38,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:38,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:38,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:38,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:08:38,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:38,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:08:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:08:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:08:38,802 INFO L87 Difference]: Start difference. First operand 6957 states and 8777 transitions. Second operand 12 states. [2019-10-03 03:08:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:42,155 INFO L93 Difference]: Finished difference Result 7230 states and 9109 transitions. [2019-10-03 03:08:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:08:42,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-10-03 03:08:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:42,174 INFO L225 Difference]: With dead ends: 7230 [2019-10-03 03:08:42,174 INFO L226 Difference]: Without dead ends: 7224 [2019-10-03 03:08:42,175 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:08:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-10-03 03:08:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7016. [2019-10-03 03:08:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2019-10-03 03:08:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8842 transitions. [2019-10-03 03:08:42,311 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8842 transitions. Word has length 140 [2019-10-03 03:08:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:42,311 INFO L475 AbstractCegarLoop]: Abstraction has 7016 states and 8842 transitions. [2019-10-03 03:08:42,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:08:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8842 transitions. [2019-10-03 03:08:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 03:08:42,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:42,320 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:42,320 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash 551555859, now seen corresponding path program 1 times [2019-10-03 03:08:42,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:42,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:42,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 03:08:42,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:42,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 03:08:42,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 03:08:42,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:08:42,699 INFO L87 Difference]: Start difference. First operand 7016 states and 8842 transitions. Second operand 14 states. [2019-10-03 03:08:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:46,228 INFO L93 Difference]: Finished difference Result 7341 states and 9239 transitions. [2019-10-03 03:08:46,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:08:46,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 140 [2019-10-03 03:08:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:46,250 INFO L225 Difference]: With dead ends: 7341 [2019-10-03 03:08:46,250 INFO L226 Difference]: Without dead ends: 7341 [2019-10-03 03:08:46,251 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 03:08:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7341 states. [2019-10-03 03:08:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7341 to 7016. [2019-10-03 03:08:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2019-10-03 03:08:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8838 transitions. [2019-10-03 03:08:46,403 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8838 transitions. Word has length 140 [2019-10-03 03:08:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:46,404 INFO L475 AbstractCegarLoop]: Abstraction has 7016 states and 8838 transitions. [2019-10-03 03:08:46,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 03:08:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8838 transitions. [2019-10-03 03:08:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 03:08:46,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:46,408 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:46,408 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 791795605, now seen corresponding path program 1 times [2019-10-03 03:08:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:46,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:46,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:46,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:46,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:46,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:08:46,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:46,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:08:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:08:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:08:46,771 INFO L87 Difference]: Start difference. First operand 7016 states and 8838 transitions. Second operand 12 states. [2019-10-03 03:08:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:50,124 INFO L93 Difference]: Finished difference Result 7391 states and 9314 transitions. [2019-10-03 03:08:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:08:50,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-10-03 03:08:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:50,148 INFO L225 Difference]: With dead ends: 7391 [2019-10-03 03:08:50,148 INFO L226 Difference]: Without dead ends: 7381 [2019-10-03 03:08:50,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:08:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7381 states. [2019-10-03 03:08:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7381 to 7024. [2019-10-03 03:08:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7024 states. [2019-10-03 03:08:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7024 states to 7024 states and 8848 transitions. [2019-10-03 03:08:50,312 INFO L78 Accepts]: Start accepts. Automaton has 7024 states and 8848 transitions. Word has length 140 [2019-10-03 03:08:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:50,312 INFO L475 AbstractCegarLoop]: Abstraction has 7024 states and 8848 transitions. [2019-10-03 03:08:50,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:08:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 7024 states and 8848 transitions. [2019-10-03 03:08:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 03:08:50,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:50,319 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:50,320 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash -91713385, now seen corresponding path program 1 times [2019-10-03 03:08:50,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:50,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:50,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:50,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:50,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 03:08:50,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:50,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:08:50,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:08:50,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:08:50,711 INFO L87 Difference]: Start difference. First operand 7024 states and 8848 transitions. Second operand 13 states. [2019-10-03 03:08:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:53,474 INFO L93 Difference]: Finished difference Result 7342 states and 9255 transitions. [2019-10-03 03:08:53,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:08:53,474 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2019-10-03 03:08:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:53,498 INFO L225 Difference]: With dead ends: 7342 [2019-10-03 03:08:53,498 INFO L226 Difference]: Without dead ends: 7342 [2019-10-03 03:08:53,499 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:08:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7342 states. [2019-10-03 03:08:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7342 to 7049. [2019-10-03 03:08:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-10-03 03:08:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 8896 transitions. [2019-10-03 03:08:53,647 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 8896 transitions. Word has length 140 [2019-10-03 03:08:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:53,647 INFO L475 AbstractCegarLoop]: Abstraction has 7049 states and 8896 transitions. [2019-10-03 03:08:53,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:08:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 8896 transitions. [2019-10-03 03:08:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 03:08:53,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:53,652 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:53,652 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1642391065, now seen corresponding path program 1 times [2019-10-03 03:08:53,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:53,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:53,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:53,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:54,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:54,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:08:54,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:54,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:08:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:08:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:08:54,003 INFO L87 Difference]: Start difference. First operand 7049 states and 8896 transitions. Second operand 12 states. [2019-10-03 03:08:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:56,370 INFO L93 Difference]: Finished difference Result 6831 states and 8630 transitions. [2019-10-03 03:08:56,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 03:08:56,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-10-03 03:08:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:56,383 INFO L225 Difference]: With dead ends: 6831 [2019-10-03 03:08:56,383 INFO L226 Difference]: Without dead ends: 6817 [2019-10-03 03:08:56,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-10-03 03:08:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6817 states. [2019-10-03 03:08:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 6736. [2019-10-03 03:08:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6736 states. [2019-10-03 03:08:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 8517 transitions. [2019-10-03 03:08:56,519 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 8517 transitions. Word has length 140 [2019-10-03 03:08:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:56,519 INFO L475 AbstractCegarLoop]: Abstraction has 6736 states and 8517 transitions. [2019-10-03 03:08:56,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:08:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 8517 transitions. [2019-10-03 03:08:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 03:08:56,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:56,523 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:56,523 INFO L418 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash -714050767, now seen corresponding path program 1 times [2019-10-03 03:08:56,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:56,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:56,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:56,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:56,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:08:56,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:56,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 03:08:56,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:56,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 03:08:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 03:08:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:08:56,845 INFO L87 Difference]: Start difference. First operand 6736 states and 8517 transitions. Second operand 14 states. [2019-10-03 03:09:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:00,007 INFO L93 Difference]: Finished difference Result 6943 states and 8769 transitions. [2019-10-03 03:09:00,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:09:00,012 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 140 [2019-10-03 03:09:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:00,024 INFO L225 Difference]: With dead ends: 6943 [2019-10-03 03:09:00,025 INFO L226 Difference]: Without dead ends: 6943 [2019-10-03 03:09:00,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2019-10-03 03:09:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6943 states. [2019-10-03 03:09:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6943 to 6832. [2019-10-03 03:09:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2019-10-03 03:09:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 8645 transitions. [2019-10-03 03:09:00,154 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 8645 transitions. Word has length 140 [2019-10-03 03:09:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:00,154 INFO L475 AbstractCegarLoop]: Abstraction has 6832 states and 8645 transitions. [2019-10-03 03:09:00,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 03:09:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 8645 transitions. [2019-10-03 03:09:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 03:09:00,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:00,158 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:09:00,159 INFO L418 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:00,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:00,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1020053683, now seen corresponding path program 1 times [2019-10-03 03:09:00,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:00,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:00,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:09:00,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:00,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:09:00,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:00,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:09:00,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:09:00,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:09:00,438 INFO L87 Difference]: Start difference. First operand 6832 states and 8645 transitions. Second operand 12 states. [2019-10-03 03:09:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:02,682 INFO L93 Difference]: Finished difference Result 6652 states and 8381 transitions. [2019-10-03 03:09:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:09:02,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-10-03 03:09:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:02,698 INFO L225 Difference]: With dead ends: 6652 [2019-10-03 03:09:02,698 INFO L226 Difference]: Without dead ends: 6647 [2019-10-03 03:09:02,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2019-10-03 03:09:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6647 states. [2019-10-03 03:09:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6647 to 6522. [2019-10-03 03:09:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6522 states. [2019-10-03 03:09:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6522 states to 6522 states and 8223 transitions. [2019-10-03 03:09:02,823 INFO L78 Accepts]: Start accepts. Automaton has 6522 states and 8223 transitions. Word has length 140 [2019-10-03 03:09:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:02,824 INFO L475 AbstractCegarLoop]: Abstraction has 6522 states and 8223 transitions. [2019-10-03 03:09:02,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:09:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 6522 states and 8223 transitions. [2019-10-03 03:09:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 03:09:02,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:02,827 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:09:02,827 INFO L418 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:02,827 INFO L82 PathProgramCache]: Analyzing trace with hash -578005167, now seen corresponding path program 1 times [2019-10-03 03:09:02,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:02,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:02,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:02,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:02,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:09:03,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:03,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 03:09:03,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:03,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:09:03,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:09:03,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:09:03,131 INFO L87 Difference]: Start difference. First operand 6522 states and 8223 transitions. Second operand 13 states. [2019-10-03 03:09:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:05,787 INFO L93 Difference]: Finished difference Result 6621 states and 8343 transitions. [2019-10-03 03:09:05,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 03:09:05,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2019-10-03 03:09:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:05,798 INFO L225 Difference]: With dead ends: 6621 [2019-10-03 03:09:05,799 INFO L226 Difference]: Without dead ends: 6621 [2019-10-03 03:09:05,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2019-10-03 03:09:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6621 states. [2019-10-03 03:09:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6621 to 6523. [2019-10-03 03:09:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6523 states. [2019-10-03 03:09:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 8211 transitions. [2019-10-03 03:09:05,954 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 8211 transitions. Word has length 141 [2019-10-03 03:09:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:05,954 INFO L475 AbstractCegarLoop]: Abstraction has 6523 states and 8211 transitions. [2019-10-03 03:09:05,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:09:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 8211 transitions. [2019-10-03 03:09:05,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 03:09:05,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:05,958 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:09:05,958 INFO L418 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:05,958 INFO L82 PathProgramCache]: Analyzing trace with hash -952632255, now seen corresponding path program 1 times [2019-10-03 03:09:05,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:05,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:05,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:05,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:05,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:09:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:06,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:06,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:06,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:06,021 INFO L87 Difference]: Start difference. First operand 6523 states and 8211 transitions. Second operand 4 states. [2019-10-03 03:09:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:06,110 INFO L93 Difference]: Finished difference Result 6370 states and 8043 transitions. [2019-10-03 03:09:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:06,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-03 03:09:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:06,123 INFO L225 Difference]: With dead ends: 6370 [2019-10-03 03:09:06,123 INFO L226 Difference]: Without dead ends: 6370 [2019-10-03 03:09:06,124 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6370 states. [2019-10-03 03:09:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6370 to 6282. [2019-10-03 03:09:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6282 states. [2019-10-03 03:09:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 7923 transitions. [2019-10-03 03:09:06,234 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 7923 transitions. Word has length 142 [2019-10-03 03:09:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:06,234 INFO L475 AbstractCegarLoop]: Abstraction has 6282 states and 7923 transitions. [2019-10-03 03:09:06,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 7923 transitions. [2019-10-03 03:09:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 03:09:06,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:06,237 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:09:06,237 INFO L418 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:06,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:06,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1294687692, now seen corresponding path program 1 times [2019-10-03 03:09:06,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:06,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:06,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:06,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:06,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:09:06,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:06,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:09:06,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:06,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:09:06,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:09:06,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:09:06,326 INFO L87 Difference]: Start difference. First operand 6282 states and 7923 transitions. Second operand 7 states. [2019-10-03 03:09:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:07,437 INFO L93 Difference]: Finished difference Result 6175 states and 7799 transitions. [2019-10-03 03:09:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:09:07,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-10-03 03:09:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:07,445 INFO L225 Difference]: With dead ends: 6175 [2019-10-03 03:09:07,445 INFO L226 Difference]: Without dead ends: 6159 [2019-10-03 03:09:07,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:09:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6159 states. [2019-10-03 03:09:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6159 to 6138. [2019-10-03 03:09:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6138 states. [2019-10-03 03:09:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6138 states to 6138 states and 7760 transitions. [2019-10-03 03:09:07,540 INFO L78 Accepts]: Start accepts. Automaton has 6138 states and 7760 transitions. Word has length 147 [2019-10-03 03:09:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:07,540 INFO L475 AbstractCegarLoop]: Abstraction has 6138 states and 7760 transitions. [2019-10-03 03:09:07,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:09:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6138 states and 7760 transitions. [2019-10-03 03:09:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 03:09:07,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:07,546 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:09:07,546 INFO L418 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash -87319987, now seen corresponding path program 1 times [2019-10-03 03:09:07,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:07,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:07,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:07,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-03 03:09:07,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:07,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:09:07,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-10-03 03:09:07,800 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [15], [16], [42], [45], [82], [86], [89], [93], [96], [100], [101], [102], [103], [104], [106], [115], [120], [122], [129], [133], [137], [140], [144], [145], [146], [150], [153], [161], [162], [165], [167], [170], [172], [173], [175], [178], [180], [185], [196], [199], [200], [201], [205], [209], [213], [217], [221], [225], [229], [233], [237], [241], [245], [249], [250], [260], [264], [269], [271], [276], [278], [283], [285], [345], [346], [349], [358], [360], [427], [430], [433], [435], [438], [440], [443], [461], [464], [495], [498], [539], [541], [542], [543], [544], [545], [546], [547], [551], [554], [562], [566], [569], [570], [574], [577], [581], [582], [583], [586], [587], [590], [591], [592], [593], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [616], [617], [626], [627], [628], [629], [630], [631], [634], [635], [642], [643], [660], [661], [662] [2019-10-03 03:09:07,842 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:09:07,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:09:07,994 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:09:08,186 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:09:08,188 INFO L272 AbstractInterpreter]: Visited 100 different actions 100 times. Never merged. Never widened. Performed 859 root evaluator evaluations with a maximum evaluation depth of 8. Performed 859 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 123 variables. [2019-10-03 03:09:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:08,193 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:09:08,696 INFO L227 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 79.02% of their original sizes. [2019-10-03 03:09:08,696 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:09:17,443 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-10-03 03:09:17,443 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:09:17,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:09:17,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [86] imperfect sequences [16] total 100 [2019-10-03 03:09:17,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:17,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-03 03:09:17,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-03 03:09:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=6863, Unknown=0, NotChecked=0, Total=7310 [2019-10-03 03:09:17,450 INFO L87 Difference]: Start difference. First operand 6138 states and 7760 transitions. Second operand 86 states. [2019-10-03 03:09:29,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:09:29,878 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~nomsg~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:83) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalEvaluator.evaluate(NonrelationalEvaluator.java:81) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:297) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:156) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:708) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:637) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-03 03:09:29,885 INFO L168 Benchmark]: Toolchain (without parser) took 75569.86 ms. Allocated memory was 135.3 MB in the beginning and 937.4 MB in the end (delta: 802.2 MB). Free memory was 90.4 MB in the beginning and 491.7 MB in the end (delta: -401.3 MB). Peak memory consumption was 400.9 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:29,886 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 03:09:29,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.52 ms. Allocated memory was 135.3 MB in the beginning and 202.4 MB in the end (delta: 67.1 MB). Free memory was 90.2 MB in the beginning and 170.4 MB in the end (delta: -80.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:29,887 INFO L168 Benchmark]: Boogie Preprocessor took 72.38 ms. Allocated memory is still 202.4 MB. Free memory was 170.4 MB in the beginning and 167.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:29,888 INFO L168 Benchmark]: RCFGBuilder took 955.18 ms. Allocated memory is still 202.4 MB. Free memory was 167.4 MB in the beginning and 106.6 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:29,890 INFO L168 Benchmark]: TraceAbstraction took 73925.23 ms. Allocated memory was 202.4 MB in the beginning and 937.4 MB in the end (delta: 735.1 MB). Free memory was 106.0 MB in the beginning and 491.7 MB in the end (delta: -385.7 MB). Peak memory consumption was 349.3 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:29,902 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 611.52 ms. Allocated memory was 135.3 MB in the beginning and 202.4 MB in the end (delta: 67.1 MB). Free memory was 90.2 MB in the beginning and 170.4 MB in the end (delta: -80.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.38 ms. Allocated memory is still 202.4 MB. Free memory was 170.4 MB in the beginning and 167.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 955.18 ms. Allocated memory is still 202.4 MB. Free memory was 167.4 MB in the beginning and 106.6 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73925.23 ms. Allocated memory was 202.4 MB in the beginning and 937.4 MB in the end (delta: 735.1 MB). Free memory was 106.0 MB in the beginning and 491.7 MB in the end (delta: -385.7 MB). Peak memory consumption was 349.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~nomsg~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~nomsg~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...