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/systemc/transmitter.06.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:12:22,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:12:22,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:12:22,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:12:22,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:12:22,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:12:22,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:12:22,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:12:22,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:12:22,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:12:22,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:12:22,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:12:22,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:12:22,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:12:22,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:12:22,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:12:22,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:12:22,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:12:22,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:12:22,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:12:22,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:12:22,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:12:22,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:12:22,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:12:22,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:12:22,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:12:22,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:12:22,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:12:22,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:12:22,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:12:22,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:12:22,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:12:22,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:12:22,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:12:22,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:12:22,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:12:22,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:12:22,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:12:22,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:12:22,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:12:22,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:12:22,650 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 04:12:22,672 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:12:22,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:12:22,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:12:22,674 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:12:22,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:12:22,675 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:12:22,675 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:12:22,675 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:12:22,676 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:12:22,676 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:12:22,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:12:22,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:12:22,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:12:22,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:12:22,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:12:22,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:12:22,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:12:22,680 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:12:22,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:12:22,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:12:22,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:12:22,681 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:12:22,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:12:22,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:12:22,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:12:22,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:12:22,682 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:12:22,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:12:22,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:12:22,683 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:12:22,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:12:22,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:12:22,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:12:22,752 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:12:22,753 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:12:22,754 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-10-03 04:12:22,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f878a504c/29a0ff3f02764963a136b8d371cdba7a/FLAGf01cc5c2d [2019-10-03 04:12:23,287 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:12:23,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-10-03 04:12:23,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f878a504c/29a0ff3f02764963a136b8d371cdba7a/FLAGf01cc5c2d [2019-10-03 04:12:23,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f878a504c/29a0ff3f02764963a136b8d371cdba7a [2019-10-03 04:12:23,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:12:23,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:12:23,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:12:23,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:12:23,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:12:23,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:12:23" (1/1) ... [2019-10-03 04:12:23,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358a6207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:23, skipping insertion in model container [2019-10-03 04:12:23,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:12:23" (1/1) ... [2019-10-03 04:12:23,688 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:12:23,743 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:12:24,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:12:24,168 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:12:24,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:12:24,259 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:12:24,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24 WrapperNode [2019-10-03 04:12:24,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:12:24,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:12:24,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:12:24,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:12:24,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (1/1) ... [2019-10-03 04:12:24,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (1/1) ... [2019-10-03 04:12:24,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (1/1) ... [2019-10-03 04:12:24,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (1/1) ... [2019-10-03 04:12:24,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (1/1) ... [2019-10-03 04:12:24,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (1/1) ... [2019-10-03 04:12:24,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (1/1) ... [2019-10-03 04:12:24,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:12:24,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:12:24,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:12:24,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:12:24,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (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 04:12:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:12:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:12:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-03 04:12:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-03 04:12:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-03 04:12:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-03 04:12:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-03 04:12:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-03 04:12:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-10-03 04:12:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-10-03 04:12:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-03 04:12:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-03 04:12:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-03 04:12:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-03 04:12:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-03 04:12:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-10-03 04:12:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-10-03 04:12:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-03 04:12:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-03 04:12:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-03 04:12:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-03 04:12:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-03 04:12:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-03 04:12:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-03 04:12:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-03 04:12:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-03 04:12:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-03 04:12:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-03 04:12:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-03 04:12:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-03 04:12:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:12:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:12:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:12:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-03 04:12:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-03 04:12:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-03 04:12:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-03 04:12:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-03 04:12:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-03 04:12:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-10-03 04:12:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-10-03 04:12:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-03 04:12:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-03 04:12:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-03 04:12:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-03 04:12:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-03 04:12:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-03 04:12:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-10-03 04:12:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-10-03 04:12:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-03 04:12:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-03 04:12:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-03 04:12:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-03 04:12:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-03 04:12:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-03 04:12:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-03 04:12:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-03 04:12:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-03 04:12:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-03 04:12:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-03 04:12:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-03 04:12:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:12:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:12:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:12:25,188 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:12:25,188 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 04:12:25,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:12:25 BoogieIcfgContainer [2019-10-03 04:12:25,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:12:25,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:12:25,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:12:25,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:12:25,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:12:23" (1/3) ... [2019-10-03 04:12:25,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495e0cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:12:25, skipping insertion in model container [2019-10-03 04:12:25,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:12:24" (2/3) ... [2019-10-03 04:12:25,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495e0cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:12:25, skipping insertion in model container [2019-10-03 04:12:25,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:12:25" (3/3) ... [2019-10-03 04:12:25,198 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2019-10-03 04:12:25,211 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:12:25,221 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:12:25,239 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:12:25,268 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:12:25,268 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:12:25,268 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:12:25,268 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:12:25,268 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:12:25,269 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:12:25,269 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:12:25,269 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:12:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states. [2019-10-03 04:12:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:25,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:25,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:25,316 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:25,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1616556766, now seen corresponding path program 1 times [2019-10-03 04:12:25,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:25,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:25,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:25,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:25,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:25,789 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 04:12:25,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:25,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:12:25,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:25,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:12:25,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:12:25,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:12:25,817 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 4 states. [2019-10-03 04:12:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:26,087 INFO L93 Difference]: Finished difference Result 287 states and 403 transitions. [2019-10-03 04:12:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:12:26,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-03 04:12:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:26,106 INFO L225 Difference]: With dead ends: 287 [2019-10-03 04:12:26,106 INFO L226 Difference]: Without dead ends: 280 [2019-10-03 04:12:26,108 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 04:12:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-03 04:12:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-10-03 04:12:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 396 transitions. [2019-10-03 04:12:26,177 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 396 transitions. Word has length 150 [2019-10-03 04:12:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:26,179 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 396 transitions. [2019-10-03 04:12:26,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:12:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 396 transitions. [2019-10-03 04:12:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:26,183 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:26,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:26,184 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:26,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -668504800, now seen corresponding path program 1 times [2019-10-03 04:12:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:26,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:26,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:26,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:26,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:26,451 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 04:12:26,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:26,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:26,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:26,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:26,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:26,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:26,455 INFO L87 Difference]: Start difference. First operand 280 states and 396 transitions. Second operand 5 states. [2019-10-03 04:12:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:27,205 INFO L93 Difference]: Finished difference Result 324 states and 474 transitions. [2019-10-03 04:12:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:27,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:27,210 INFO L225 Difference]: With dead ends: 324 [2019-10-03 04:12:27,210 INFO L226 Difference]: Without dead ends: 324 [2019-10-03 04:12:27,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-03 04:12:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-10-03 04:12:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 395 transitions. [2019-10-03 04:12:27,235 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 395 transitions. Word has length 150 [2019-10-03 04:12:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:27,235 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 395 transitions. [2019-10-03 04:12:27,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 395 transitions. [2019-10-03 04:12:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:27,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:27,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:27,240 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:27,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash 278533086, now seen corresponding path program 1 times [2019-10-03 04:12:27,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:27,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:27,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:27,379 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 04:12:27,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:27,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:27,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:27,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:27,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:27,382 INFO L87 Difference]: Start difference. First operand 280 states and 395 transitions. Second operand 5 states. [2019-10-03 04:12:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:28,046 INFO L93 Difference]: Finished difference Result 324 states and 474 transitions. [2019-10-03 04:12:28,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:28,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:28,050 INFO L225 Difference]: With dead ends: 324 [2019-10-03 04:12:28,050 INFO L226 Difference]: Without dead ends: 324 [2019-10-03 04:12:28,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-03 04:12:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-10-03 04:12:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 394 transitions. [2019-10-03 04:12:28,079 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 394 transitions. Word has length 150 [2019-10-03 04:12:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:28,080 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 394 transitions. [2019-10-03 04:12:28,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 394 transitions. [2019-10-03 04:12:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:28,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:28,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:28,087 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1140366688, now seen corresponding path program 1 times [2019-10-03 04:12:28,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:28,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:28,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:28,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:28,215 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 04:12:28,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:28,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:28,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:28,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:28,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:28,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:28,217 INFO L87 Difference]: Start difference. First operand 280 states and 394 transitions. Second operand 5 states. [2019-10-03 04:12:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:28,778 INFO L93 Difference]: Finished difference Result 322 states and 469 transitions. [2019-10-03 04:12:28,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:28,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:28,781 INFO L225 Difference]: With dead ends: 322 [2019-10-03 04:12:28,782 INFO L226 Difference]: Without dead ends: 322 [2019-10-03 04:12:28,782 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-03 04:12:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 280. [2019-10-03 04:12:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 393 transitions. [2019-10-03 04:12:28,796 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 393 transitions. Word has length 150 [2019-10-03 04:12:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:28,797 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 393 transitions. [2019-10-03 04:12:28,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 393 transitions. [2019-10-03 04:12:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:28,799 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:28,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:28,800 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:28,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:28,800 INFO L82 PathProgramCache]: Analyzing trace with hash -910042210, now seen corresponding path program 1 times [2019-10-03 04:12:28,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:28,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:28,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:28,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:28,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:28,881 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 04:12:28,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:28,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:28,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:28,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:28,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:28,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:28,884 INFO L87 Difference]: Start difference. First operand 280 states and 393 transitions. Second operand 5 states. [2019-10-03 04:12:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:29,507 INFO L93 Difference]: Finished difference Result 320 states and 464 transitions. [2019-10-03 04:12:29,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:29,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:29,510 INFO L225 Difference]: With dead ends: 320 [2019-10-03 04:12:29,510 INFO L226 Difference]: Without dead ends: 320 [2019-10-03 04:12:29,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-03 04:12:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 280. [2019-10-03 04:12:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 392 transitions. [2019-10-03 04:12:29,523 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 392 transitions. Word has length 150 [2019-10-03 04:12:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:29,524 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 392 transitions. [2019-10-03 04:12:29,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 392 transitions. [2019-10-03 04:12:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:29,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:29,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:29,526 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:29,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash -421995104, now seen corresponding path program 1 times [2019-10-03 04:12:29,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:29,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:29,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:29,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:29,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:29,602 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 04:12:29,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:29,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:29,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:29,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:29,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:29,604 INFO L87 Difference]: Start difference. First operand 280 states and 392 transitions. Second operand 5 states. [2019-10-03 04:12:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:30,280 INFO L93 Difference]: Finished difference Result 318 states and 459 transitions. [2019-10-03 04:12:30,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:30,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:30,285 INFO L225 Difference]: With dead ends: 318 [2019-10-03 04:12:30,285 INFO L226 Difference]: Without dead ends: 318 [2019-10-03 04:12:30,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-03 04:12:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 280. [2019-10-03 04:12:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 391 transitions. [2019-10-03 04:12:30,308 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 391 transitions. Word has length 150 [2019-10-03 04:12:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:30,311 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 391 transitions. [2019-10-03 04:12:30,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 391 transitions. [2019-10-03 04:12:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:30,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:30,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:30,315 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:30,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:30,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1514630306, now seen corresponding path program 1 times [2019-10-03 04:12:30,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:30,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:30,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:30,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:30,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:30,441 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 04:12:30,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:30,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:30,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:30,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:30,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:30,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:30,443 INFO L87 Difference]: Start difference. First operand 280 states and 391 transitions. Second operand 5 states. [2019-10-03 04:12:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:30,955 INFO L93 Difference]: Finished difference Result 314 states and 450 transitions. [2019-10-03 04:12:30,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:30,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:30,958 INFO L225 Difference]: With dead ends: 314 [2019-10-03 04:12:30,959 INFO L226 Difference]: Without dead ends: 314 [2019-10-03 04:12:30,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-03 04:12:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 280. [2019-10-03 04:12:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 390 transitions. [2019-10-03 04:12:30,971 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 390 transitions. Word has length 150 [2019-10-03 04:12:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:30,972 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 390 transitions. [2019-10-03 04:12:30,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 390 transitions. [2019-10-03 04:12:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:30,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:30,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:30,975 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:30,976 INFO L82 PathProgramCache]: Analyzing trace with hash 937861276, now seen corresponding path program 1 times [2019-10-03 04:12:30,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:30,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:30,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:30,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:31,051 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 04:12:31,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:31,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:31,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:31,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:31,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:31,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:31,053 INFO L87 Difference]: Start difference. First operand 280 states and 390 transitions. Second operand 5 states. [2019-10-03 04:12:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:31,698 INFO L93 Difference]: Finished difference Result 343 states and 501 transitions. [2019-10-03 04:12:31,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:31,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:31,702 INFO L225 Difference]: With dead ends: 343 [2019-10-03 04:12:31,702 INFO L226 Difference]: Without dead ends: 343 [2019-10-03 04:12:31,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-03 04:12:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 280. [2019-10-03 04:12:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 389 transitions. [2019-10-03 04:12:31,729 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 389 transitions. Word has length 150 [2019-10-03 04:12:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:31,730 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 389 transitions. [2019-10-03 04:12:31,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 389 transitions. [2019-10-03 04:12:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:31,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:31,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:31,733 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash -784141410, now seen corresponding path program 1 times [2019-10-03 04:12:31,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:31,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:31,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:31,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:12:31,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:31,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:31,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:31,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:31,830 INFO L87 Difference]: Start difference. First operand 280 states and 389 transitions. Second operand 5 states. [2019-10-03 04:12:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:32,367 INFO L93 Difference]: Finished difference Result 341 states and 496 transitions. [2019-10-03 04:12:32,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:32,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:32,370 INFO L225 Difference]: With dead ends: 341 [2019-10-03 04:12:32,371 INFO L226 Difference]: Without dead ends: 341 [2019-10-03 04:12:32,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-10-03 04:12:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 280. [2019-10-03 04:12:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 388 transitions. [2019-10-03 04:12:32,390 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 388 transitions. Word has length 150 [2019-10-03 04:12:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:32,390 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 388 transitions. [2019-10-03 04:12:32,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 388 transitions. [2019-10-03 04:12:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:32,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:32,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:32,394 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1116784548, now seen corresponding path program 1 times [2019-10-03 04:12:32,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:32,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:32,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:32,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:32,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:32,472 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 04:12:32,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:32,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:32,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:32,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:32,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:32,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:32,474 INFO L87 Difference]: Start difference. First operand 280 states and 388 transitions. Second operand 5 states. [2019-10-03 04:12:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:33,061 INFO L93 Difference]: Finished difference Result 339 states and 491 transitions. [2019-10-03 04:12:33,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:33,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:33,064 INFO L225 Difference]: With dead ends: 339 [2019-10-03 04:12:33,065 INFO L226 Difference]: Without dead ends: 339 [2019-10-03 04:12:33,065 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-10-03 04:12:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 280. [2019-10-03 04:12:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 387 transitions. [2019-10-03 04:12:33,075 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 387 transitions. Word has length 150 [2019-10-03 04:12:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:33,075 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 387 transitions. [2019-10-03 04:12:33,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 387 transitions. [2019-10-03 04:12:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:33,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:33,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:33,078 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash 812147678, now seen corresponding path program 1 times [2019-10-03 04:12:33,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:33,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:33,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:33,147 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 04:12:33,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:33,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:33,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:33,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:33,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:33,149 INFO L87 Difference]: Start difference. First operand 280 states and 387 transitions. Second operand 5 states. [2019-10-03 04:12:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:33,838 INFO L93 Difference]: Finished difference Result 337 states and 486 transitions. [2019-10-03 04:12:33,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:33,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:33,842 INFO L225 Difference]: With dead ends: 337 [2019-10-03 04:12:33,842 INFO L226 Difference]: Without dead ends: 337 [2019-10-03 04:12:33,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:33,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-03 04:12:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 280. [2019-10-03 04:12:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 386 transitions. [2019-10-03 04:12:33,854 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 386 transitions. Word has length 150 [2019-10-03 04:12:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:33,854 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 386 transitions. [2019-10-03 04:12:33,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 386 transitions. [2019-10-03 04:12:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:33,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:33,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:33,857 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1480933348, now seen corresponding path program 1 times [2019-10-03 04:12:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:33,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:33,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:33,956 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 04:12:33,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:33,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:33,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:33,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:33,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:33,958 INFO L87 Difference]: Start difference. First operand 280 states and 386 transitions. Second operand 5 states. [2019-10-03 04:12:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:34,507 INFO L93 Difference]: Finished difference Result 335 states and 481 transitions. [2019-10-03 04:12:34,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:34,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:34,510 INFO L225 Difference]: With dead ends: 335 [2019-10-03 04:12:34,510 INFO L226 Difference]: Without dead ends: 335 [2019-10-03 04:12:34,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-03 04:12:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 280. [2019-10-03 04:12:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2019-10-03 04:12:34,522 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 150 [2019-10-03 04:12:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:34,522 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2019-10-03 04:12:34,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2019-10-03 04:12:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:34,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:34,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:34,526 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:34,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash 246211614, now seen corresponding path program 1 times [2019-10-03 04:12:34,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:34,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:34,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:34,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:34,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:34,602 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 04:12:34,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:34,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:34,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:34,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:34,604 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand 5 states. [2019-10-03 04:12:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:35,196 INFO L93 Difference]: Finished difference Result 333 states and 476 transitions. [2019-10-03 04:12:35,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:35,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:35,200 INFO L225 Difference]: With dead ends: 333 [2019-10-03 04:12:35,201 INFO L226 Difference]: Without dead ends: 333 [2019-10-03 04:12:35,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-10-03 04:12:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 280. [2019-10-03 04:12:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 04:12:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 384 transitions. [2019-10-03 04:12:35,211 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 384 transitions. Word has length 150 [2019-10-03 04:12:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:35,213 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 384 transitions. [2019-10-03 04:12:35,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 384 transitions. [2019-10-03 04:12:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:35,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:35,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:35,217 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:35,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:35,218 INFO L82 PathProgramCache]: Analyzing trace with hash 717567964, now seen corresponding path program 1 times [2019-10-03 04:12:35,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:35,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:35,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:35,327 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 04:12:35,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:35,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:12:35,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:35,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:12:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:12:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:12:35,329 INFO L87 Difference]: Start difference. First operand 280 states and 384 transitions. Second operand 4 states. [2019-10-03 04:12:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:35,584 INFO L93 Difference]: Finished difference Result 527 states and 720 transitions. [2019-10-03 04:12:35,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:12:35,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-03 04:12:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:35,589 INFO L225 Difference]: With dead ends: 527 [2019-10-03 04:12:35,589 INFO L226 Difference]: Without dead ends: 527 [2019-10-03 04:12:35,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 04:12:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-03 04:12:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 522. [2019-10-03 04:12:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-10-03 04:12:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 716 transitions. [2019-10-03 04:12:35,614 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 716 transitions. Word has length 150 [2019-10-03 04:12:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:35,614 INFO L475 AbstractCegarLoop]: Abstraction has 522 states and 716 transitions. [2019-10-03 04:12:35,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:12:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 716 transitions. [2019-10-03 04:12:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:35,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:35,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:35,617 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:35,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1005027869, now seen corresponding path program 1 times [2019-10-03 04:12:35,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:35,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:35,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:35,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:35,722 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 04:12:35,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:35,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:12:35,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:35,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:35,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:35,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:35,725 INFO L87 Difference]: Start difference. First operand 522 states and 716 transitions. Second operand 6 states. [2019-10-03 04:12:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:35,762 INFO L93 Difference]: Finished difference Result 547 states and 754 transitions. [2019-10-03 04:12:35,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:35,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-03 04:12:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:35,769 INFO L225 Difference]: With dead ends: 547 [2019-10-03 04:12:35,769 INFO L226 Difference]: Without dead ends: 547 [2019-10-03 04:12:35,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-03 04:12:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 527. [2019-10-03 04:12:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-10-03 04:12:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 720 transitions. [2019-10-03 04:12:35,785 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 720 transitions. Word has length 150 [2019-10-03 04:12:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:35,785 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 720 transitions. [2019-10-03 04:12:35,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 720 transitions. [2019-10-03 04:12:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:35,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:35,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:35,788 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2036068767, now seen corresponding path program 1 times [2019-10-03 04:12:35,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:35,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:35,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:35,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:35,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:35,851 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 04:12:35,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:35,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:12:35,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:35,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:12:35,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:12:35,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:12:35,853 INFO L87 Difference]: Start difference. First operand 527 states and 720 transitions. Second operand 4 states. [2019-10-03 04:12:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:36,159 INFO L93 Difference]: Finished difference Result 1016 states and 1383 transitions. [2019-10-03 04:12:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:12:36,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-03 04:12:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:36,167 INFO L225 Difference]: With dead ends: 1016 [2019-10-03 04:12:36,167 INFO L226 Difference]: Without dead ends: 1016 [2019-10-03 04:12:36,168 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 04:12:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-03 04:12:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1009. [2019-10-03 04:12:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-10-03 04:12:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1377 transitions. [2019-10-03 04:12:36,208 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1377 transitions. Word has length 150 [2019-10-03 04:12:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:36,209 INFO L475 AbstractCegarLoop]: Abstraction has 1009 states and 1377 transitions. [2019-10-03 04:12:36,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:12:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1377 transitions. [2019-10-03 04:12:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:36,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:36,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:36,214 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:36,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1903302082, now seen corresponding path program 1 times [2019-10-03 04:12:36,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:36,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:36,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:36,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:36,296 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 04:12:36,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:36,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:12:36,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:36,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:36,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:36,298 INFO L87 Difference]: Start difference. First operand 1009 states and 1377 transitions. Second operand 6 states. [2019-10-03 04:12:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:36,336 INFO L93 Difference]: Finished difference Result 1053 states and 1443 transitions. [2019-10-03 04:12:36,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:36,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-03 04:12:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:36,343 INFO L225 Difference]: With dead ends: 1053 [2019-10-03 04:12:36,343 INFO L226 Difference]: Without dead ends: 1053 [2019-10-03 04:12:36,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-10-03 04:12:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1019. [2019-10-03 04:12:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-10-03 04:12:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1385 transitions. [2019-10-03 04:12:36,373 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1385 transitions. Word has length 150 [2019-10-03 04:12:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:36,374 INFO L475 AbstractCegarLoop]: Abstraction has 1019 states and 1385 transitions. [2019-10-03 04:12:36,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1385 transitions. [2019-10-03 04:12:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:36,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:36,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:36,377 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash -26238852, now seen corresponding path program 1 times [2019-10-03 04:12:36,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:36,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:36,458 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 04:12:36,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:36,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:12:36,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:36,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:12:36,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:12:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:12:36,461 INFO L87 Difference]: Start difference. First operand 1019 states and 1385 transitions. Second operand 4 states. [2019-10-03 04:12:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:36,753 INFO L93 Difference]: Finished difference Result 1988 states and 2695 transitions. [2019-10-03 04:12:36,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:12:36,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-03 04:12:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:36,766 INFO L225 Difference]: With dead ends: 1988 [2019-10-03 04:12:36,767 INFO L226 Difference]: Without dead ends: 1988 [2019-10-03 04:12:36,767 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 04:12:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-10-03 04:12:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1977. [2019-10-03 04:12:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-03 04:12:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2685 transitions. [2019-10-03 04:12:36,833 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2685 transitions. Word has length 150 [2019-10-03 04:12:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:36,833 INFO L475 AbstractCegarLoop]: Abstraction has 1977 states and 2685 transitions. [2019-10-03 04:12:36,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:12:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2685 transitions. [2019-10-03 04:12:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:36,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:36,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:36,836 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:36,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1511479043, now seen corresponding path program 1 times [2019-10-03 04:12:36,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:36,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:36,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:36,941 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 04:12:36,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:36,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:12:36,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:36,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:36,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:36,945 INFO L87 Difference]: Start difference. First operand 1977 states and 2685 transitions. Second operand 6 states. [2019-10-03 04:12:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:36,982 INFO L93 Difference]: Finished difference Result 2053 states and 2797 transitions. [2019-10-03 04:12:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:36,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-03 04:12:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:36,995 INFO L225 Difference]: With dead ends: 2053 [2019-10-03 04:12:36,995 INFO L226 Difference]: Without dead ends: 2053 [2019-10-03 04:12:36,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-10-03 04:12:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1997. [2019-10-03 04:12:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-10-03 04:12:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2701 transitions. [2019-10-03 04:12:37,057 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2701 transitions. Word has length 150 [2019-10-03 04:12:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:37,059 INFO L475 AbstractCegarLoop]: Abstraction has 1997 states and 2701 transitions. [2019-10-03 04:12:37,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2701 transitions. [2019-10-03 04:12:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:37,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:37,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:37,062 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:37,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1725650175, now seen corresponding path program 1 times [2019-10-03 04:12:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:37,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:37,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:37,129 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 04:12:37,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:37,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:12:37,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:37,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:37,133 INFO L87 Difference]: Start difference. First operand 1997 states and 2701 transitions. Second operand 6 states. [2019-10-03 04:12:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:37,178 INFO L93 Difference]: Finished difference Result 2125 states and 2894 transitions. [2019-10-03 04:12:37,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:37,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-03 04:12:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:37,189 INFO L225 Difference]: With dead ends: 2125 [2019-10-03 04:12:37,190 INFO L226 Difference]: Without dead ends: 2125 [2019-10-03 04:12:37,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-10-03 04:12:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2037. [2019-10-03 04:12:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-10-03 04:12:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2741 transitions. [2019-10-03 04:12:37,249 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2741 transitions. Word has length 150 [2019-10-03 04:12:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:37,250 INFO L475 AbstractCegarLoop]: Abstraction has 2037 states and 2741 transitions. [2019-10-03 04:12:37,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2741 transitions. [2019-10-03 04:12:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:37,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:37,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:37,253 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:37,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1802550973, now seen corresponding path program 1 times [2019-10-03 04:12:37,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:37,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:37,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:37,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:37,328 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 04:12:37,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:37,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:12:37,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:37,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:12:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:12:37,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:12:37,330 INFO L87 Difference]: Start difference. First operand 2037 states and 2741 transitions. Second operand 4 states. [2019-10-03 04:12:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:37,625 INFO L93 Difference]: Finished difference Result 4000 states and 5377 transitions. [2019-10-03 04:12:37,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:12:37,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-03 04:12:37,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:37,649 INFO L225 Difference]: With dead ends: 4000 [2019-10-03 04:12:37,649 INFO L226 Difference]: Without dead ends: 4000 [2019-10-03 04:12:37,650 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 04:12:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2019-10-03 04:12:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3981. [2019-10-03 04:12:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2019-10-03 04:12:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 5359 transitions. [2019-10-03 04:12:37,791 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 5359 transitions. Word has length 150 [2019-10-03 04:12:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:37,792 INFO L475 AbstractCegarLoop]: Abstraction has 3981 states and 5359 transitions. [2019-10-03 04:12:37,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:12:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 5359 transitions. [2019-10-03 04:12:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:37,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:37,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:37,794 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:37,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1354787458, now seen corresponding path program 1 times [2019-10-03 04:12:37,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:37,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:37,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:37,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:37,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:37,870 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 04:12:37,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:37,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:12:37,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:37,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:37,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:37,872 INFO L87 Difference]: Start difference. First operand 3981 states and 5359 transitions. Second operand 6 states. [2019-10-03 04:12:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:37,920 INFO L93 Difference]: Finished difference Result 4085 states and 5503 transitions. [2019-10-03 04:12:37,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:37,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-03 04:12:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:37,946 INFO L225 Difference]: With dead ends: 4085 [2019-10-03 04:12:37,947 INFO L226 Difference]: Without dead ends: 4085 [2019-10-03 04:12:37,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-10-03 04:12:38,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4021. [2019-10-03 04:12:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2019-10-03 04:12:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5391 transitions. [2019-10-03 04:12:38,128 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5391 transitions. Word has length 150 [2019-10-03 04:12:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:38,129 INFO L475 AbstractCegarLoop]: Abstraction has 4021 states and 5391 transitions. [2019-10-03 04:12:38,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5391 transitions. [2019-10-03 04:12:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:38,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:38,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:38,131 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1772184064, now seen corresponding path program 1 times [2019-10-03 04:12:38,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:38,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:38,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:38,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:38,201 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 04:12:38,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:38,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:12:38,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:38,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:38,203 INFO L87 Difference]: Start difference. First operand 4021 states and 5391 transitions. Second operand 6 states. [2019-10-03 04:12:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:38,250 INFO L93 Difference]: Finished difference Result 4181 states and 5616 transitions. [2019-10-03 04:12:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:38,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-03 04:12:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:38,289 INFO L225 Difference]: With dead ends: 4181 [2019-10-03 04:12:38,290 INFO L226 Difference]: Without dead ends: 4181 [2019-10-03 04:12:38,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-10-03 04:12:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4101. [2019-10-03 04:12:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-10-03 04:12:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5471 transitions. [2019-10-03 04:12:38,417 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5471 transitions. Word has length 150 [2019-10-03 04:12:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:38,418 INFO L475 AbstractCegarLoop]: Abstraction has 4101 states and 5471 transitions. [2019-10-03 04:12:38,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5471 transitions. [2019-10-03 04:12:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:38,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:38,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:38,420 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash -896165058, now seen corresponding path program 1 times [2019-10-03 04:12:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:38,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:38,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:38,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:38,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:38,495 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 04:12:38,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:38,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:12:38,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:38,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:12:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:12:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:38,497 INFO L87 Difference]: Start difference. First operand 4101 states and 5471 transitions. Second operand 6 states. [2019-10-03 04:12:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:38,536 INFO L93 Difference]: Finished difference Result 4213 states and 5616 transitions. [2019-10-03 04:12:38,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:38,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-03 04:12:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:38,555 INFO L225 Difference]: With dead ends: 4213 [2019-10-03 04:12:38,555 INFO L226 Difference]: Without dead ends: 4213 [2019-10-03 04:12:38,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:12:38,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2019-10-03 04:12:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4181. [2019-10-03 04:12:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4181 states. [2019-10-03 04:12:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 4181 states and 5551 transitions. [2019-10-03 04:12:38,662 INFO L78 Accepts]: Start accepts. Automaton has 4181 states and 5551 transitions. Word has length 150 [2019-10-03 04:12:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:38,665 INFO L475 AbstractCegarLoop]: Abstraction has 4181 states and 5551 transitions. [2019-10-03 04:12:38,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:12:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 5551 transitions. [2019-10-03 04:12:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:38,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:38,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:38,668 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2678720, now seen corresponding path program 1 times [2019-10-03 04:12:38,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:38,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:38,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:38,761 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 04:12:38,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:38,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:38,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:38,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:38,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:38,763 INFO L87 Difference]: Start difference. First operand 4181 states and 5551 transitions. Second operand 5 states. [2019-10-03 04:12:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:39,677 INFO L93 Difference]: Finished difference Result 6125 states and 8080 transitions. [2019-10-03 04:12:39,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 04:12:39,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:39,713 INFO L225 Difference]: With dead ends: 6125 [2019-10-03 04:12:39,713 INFO L226 Difference]: Without dead ends: 6125 [2019-10-03 04:12:39,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:12:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2019-10-03 04:12:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 5757. [2019-10-03 04:12:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-03 04:12:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7407 transitions. [2019-10-03 04:12:39,947 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7407 transitions. Word has length 150 [2019-10-03 04:12:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:39,948 INFO L475 AbstractCegarLoop]: Abstraction has 5757 states and 7407 transitions. [2019-10-03 04:12:39,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7407 transitions. [2019-10-03 04:12:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:39,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:39,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:39,952 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash 420968002, now seen corresponding path program 1 times [2019-10-03 04:12:39,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:39,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:39,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:40,075 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 04:12:40,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:40,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:40,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:40,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:40,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:40,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:40,077 INFO L87 Difference]: Start difference. First operand 5757 states and 7407 transitions. Second operand 5 states. [2019-10-03 04:12:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:40,601 INFO L93 Difference]: Finished difference Result 5757 states and 7367 transitions. [2019-10-03 04:12:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:40,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:40,623 INFO L225 Difference]: With dead ends: 5757 [2019-10-03 04:12:40,623 INFO L226 Difference]: Without dead ends: 5757 [2019-10-03 04:12:40,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-03 04:12:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-03 04:12:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-03 04:12:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7367 transitions. [2019-10-03 04:12:40,734 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7367 transitions. Word has length 150 [2019-10-03 04:12:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:40,735 INFO L475 AbstractCegarLoop]: Abstraction has 5757 states and 7367 transitions. [2019-10-03 04:12:40,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7367 transitions. [2019-10-03 04:12:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:40,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:40,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:40,737 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -950839296, now seen corresponding path program 1 times [2019-10-03 04:12:40,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:40,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:40,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:40,835 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 04:12:40,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:40,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:40,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:40,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:40,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:40,837 INFO L87 Difference]: Start difference. First operand 5757 states and 7367 transitions. Second operand 5 states. [2019-10-03 04:12:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:41,354 INFO L93 Difference]: Finished difference Result 5757 states and 7327 transitions. [2019-10-03 04:12:41,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:41,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:41,391 INFO L225 Difference]: With dead ends: 5757 [2019-10-03 04:12:41,391 INFO L226 Difference]: Without dead ends: 5757 [2019-10-03 04:12:41,391 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-03 04:12:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-03 04:12:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-03 04:12:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7327 transitions. [2019-10-03 04:12:41,581 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7327 transitions. Word has length 150 [2019-10-03 04:12:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:41,583 INFO L475 AbstractCegarLoop]: Abstraction has 5757 states and 7327 transitions. [2019-10-03 04:12:41,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7327 transitions. [2019-10-03 04:12:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:41,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:41,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:41,586 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:41,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:41,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1980198594, now seen corresponding path program 1 times [2019-10-03 04:12:41,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:41,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:41,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:41,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:41,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:41,658 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 04:12:41,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:41,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:41,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:41,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:41,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:41,660 INFO L87 Difference]: Start difference. First operand 5757 states and 7327 transitions. Second operand 5 states. [2019-10-03 04:12:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:42,150 INFO L93 Difference]: Finished difference Result 5757 states and 7287 transitions. [2019-10-03 04:12:42,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:42,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:42,172 INFO L225 Difference]: With dead ends: 5757 [2019-10-03 04:12:42,172 INFO L226 Difference]: Without dead ends: 5757 [2019-10-03 04:12:42,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-03 04:12:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-03 04:12:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-03 04:12:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7287 transitions. [2019-10-03 04:12:42,277 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7287 transitions. Word has length 150 [2019-10-03 04:12:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:42,278 INFO L475 AbstractCegarLoop]: Abstraction has 5757 states and 7287 transitions. [2019-10-03 04:12:42,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7287 transitions. [2019-10-03 04:12:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:42,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:42,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:42,282 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1320667072, now seen corresponding path program 1 times [2019-10-03 04:12:42,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:42,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:42,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:42,390 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 04:12:42,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:42,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:42,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:42,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:42,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:42,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:42,392 INFO L87 Difference]: Start difference. First operand 5757 states and 7287 transitions. Second operand 5 states. [2019-10-03 04:12:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:43,078 INFO L93 Difference]: Finished difference Result 7967 states and 10094 transitions. [2019-10-03 04:12:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:43,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:43,100 INFO L225 Difference]: With dead ends: 7967 [2019-10-03 04:12:43,100 INFO L226 Difference]: Without dead ends: 7967 [2019-10-03 04:12:43,101 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 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 04:12:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2019-10-03 04:12:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 7671. [2019-10-03 04:12:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7671 states. [2019-10-03 04:12:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 9517 transitions. [2019-10-03 04:12:43,557 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 9517 transitions. Word has length 150 [2019-10-03 04:12:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:43,557 INFO L475 AbstractCegarLoop]: Abstraction has 7671 states and 9517 transitions. [2019-10-03 04:12:43,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 9517 transitions. [2019-10-03 04:12:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:43,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:43,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:43,560 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:43,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1715033858, now seen corresponding path program 1 times [2019-10-03 04:12:43,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:43,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:43,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:43,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:43,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:43,636 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 04:12:43,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:43,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:43,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:43,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:43,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:43,638 INFO L87 Difference]: Start difference. First operand 7671 states and 9517 transitions. Second operand 5 states. [2019-10-03 04:12:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:44,173 INFO L93 Difference]: Finished difference Result 7671 states and 9461 transitions. [2019-10-03 04:12:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:12:44,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:44,203 INFO L225 Difference]: With dead ends: 7671 [2019-10-03 04:12:44,203 INFO L226 Difference]: Without dead ends: 7671 [2019-10-03 04:12:44,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7671 states. [2019-10-03 04:12:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7671 to 7671. [2019-10-03 04:12:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7671 states. [2019-10-03 04:12:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 9461 transitions. [2019-10-03 04:12:44,381 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 9461 transitions. Word has length 150 [2019-10-03 04:12:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:44,382 INFO L475 AbstractCegarLoop]: Abstraction has 7671 states and 9461 transitions. [2019-10-03 04:12:44,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 9461 transitions. [2019-10-03 04:12:44,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:44,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:44,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:44,387 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1735927936, now seen corresponding path program 1 times [2019-10-03 04:12:44,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:44,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:44,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:44,505 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 04:12:44,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:44,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:44,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:44,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:44,507 INFO L87 Difference]: Start difference. First operand 7671 states and 9461 transitions. Second operand 5 states. [2019-10-03 04:12:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:45,682 INFO L93 Difference]: Finished difference Result 8547 states and 10501 transitions. [2019-10-03 04:12:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:45,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:45,714 INFO L225 Difference]: With dead ends: 8547 [2019-10-03 04:12:45,714 INFO L226 Difference]: Without dead ends: 8547 [2019-10-03 04:12:45,715 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 04:12:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8547 states. [2019-10-03 04:12:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8547 to 8543. [2019-10-03 04:12:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8543 states. [2019-10-03 04:12:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8543 states to 8543 states and 10497 transitions. [2019-10-03 04:12:46,052 INFO L78 Accepts]: Start accepts. Automaton has 8543 states and 10497 transitions. Word has length 150 [2019-10-03 04:12:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:46,053 INFO L475 AbstractCegarLoop]: Abstraction has 8543 states and 10497 transitions. [2019-10-03 04:12:46,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 8543 states and 10497 transitions. [2019-10-03 04:12:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:46,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:46,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:46,057 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash -508055362, now seen corresponding path program 1 times [2019-10-03 04:12:46,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:46,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:46,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:46,182 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 04:12:46,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:46,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:46,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:46,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:46,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:46,185 INFO L87 Difference]: Start difference. First operand 8543 states and 10497 transitions. Second operand 5 states. [2019-10-03 04:12:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:47,057 INFO L93 Difference]: Finished difference Result 9659 states and 12081 transitions. [2019-10-03 04:12:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:47,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:47,095 INFO L225 Difference]: With dead ends: 9659 [2019-10-03 04:12:47,095 INFO L226 Difference]: Without dead ends: 9659 [2019-10-03 04:12:47,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 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 04:12:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9659 states. [2019-10-03 04:12:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9659 to 9167. [2019-10-03 04:12:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9167 states. [2019-10-03 04:12:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9167 states to 9167 states and 11093 transitions. [2019-10-03 04:12:47,306 INFO L78 Accepts]: Start accepts. Automaton has 9167 states and 11093 transitions. Word has length 150 [2019-10-03 04:12:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:47,307 INFO L475 AbstractCegarLoop]: Abstraction has 9167 states and 11093 transitions. [2019-10-03 04:12:47,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 9167 states and 11093 transitions. [2019-10-03 04:12:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:47,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:47,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:47,309 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -580441920, now seen corresponding path program 1 times [2019-10-03 04:12:47,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:47,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:47,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:12:47,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:47,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:47,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:47,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:47,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:47,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:47,444 INFO L87 Difference]: Start difference. First operand 9167 states and 11093 transitions. Second operand 5 states. [2019-10-03 04:12:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:48,357 INFO L93 Difference]: Finished difference Result 10479 states and 12861 transitions. [2019-10-03 04:12:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:48,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:48,443 INFO L225 Difference]: With dead ends: 10479 [2019-10-03 04:12:48,443 INFO L226 Difference]: Without dead ends: 10479 [2019-10-03 04:12:48,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 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 04:12:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10479 states. [2019-10-03 04:12:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10479 to 9615. [2019-10-03 04:12:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-10-03 04:12:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 11445 transitions. [2019-10-03 04:12:48,613 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 11445 transitions. Word has length 150 [2019-10-03 04:12:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:48,614 INFO L475 AbstractCegarLoop]: Abstraction has 9615 states and 11445 transitions. [2019-10-03 04:12:48,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 11445 transitions. [2019-10-03 04:12:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:48,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:48,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:48,616 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash -305682306, now seen corresponding path program 1 times [2019-10-03 04:12:48,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:48,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:48,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:48,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:48,703 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 04:12:48,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:48,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:48,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:48,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:48,704 INFO L87 Difference]: Start difference. First operand 9615 states and 11445 transitions. Second operand 5 states. [2019-10-03 04:12:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:49,511 INFO L93 Difference]: Finished difference Result 10651 states and 12881 transitions. [2019-10-03 04:12:49,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:49,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:49,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:49,534 INFO L225 Difference]: With dead ends: 10651 [2019-10-03 04:12:49,534 INFO L226 Difference]: Without dead ends: 10651 [2019-10-03 04:12:49,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 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 04:12:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10651 states. [2019-10-03 04:12:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10651 to 10003. [2019-10-03 04:12:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10003 states. [2019-10-03 04:12:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10003 states to 10003 states and 11713 transitions. [2019-10-03 04:12:49,687 INFO L78 Accepts]: Start accepts. Automaton has 10003 states and 11713 transitions. Word has length 150 [2019-10-03 04:12:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:49,687 INFO L475 AbstractCegarLoop]: Abstraction has 10003 states and 11713 transitions. [2019-10-03 04:12:49,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 10003 states and 11713 transitions. [2019-10-03 04:12:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:49,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:49,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:49,689 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:49,690 INFO L82 PathProgramCache]: Analyzing trace with hash -283050052, now seen corresponding path program 1 times [2019-10-03 04:12:49,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:49,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:49,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:49,758 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 04:12:49,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:49,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:12:49,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:49,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:12:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:12:49,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:12:49,760 INFO L87 Difference]: Start difference. First operand 10003 states and 11713 transitions. Second operand 5 states. [2019-10-03 04:12:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:50,563 INFO L93 Difference]: Finished difference Result 12027 states and 14700 transitions. [2019-10-03 04:12:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:12:50,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:12:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:50,588 INFO L225 Difference]: With dead ends: 12027 [2019-10-03 04:12:50,588 INFO L226 Difference]: Without dead ends: 12027 [2019-10-03 04:12:50,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 04:12:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12027 states. [2019-10-03 04:12:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12027 to 10907. [2019-10-03 04:12:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10907 states. [2019-10-03 04:12:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10907 states to 10907 states and 12529 transitions. [2019-10-03 04:12:50,756 INFO L78 Accepts]: Start accepts. Automaton has 10907 states and 12529 transitions. Word has length 150 [2019-10-03 04:12:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:50,757 INFO L475 AbstractCegarLoop]: Abstraction has 10907 states and 12529 transitions. [2019-10-03 04:12:50,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:12:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 10907 states and 12529 transitions. [2019-10-03 04:12:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:12:50,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:50,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:50,759 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:50,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1103153342, now seen corresponding path program 1 times [2019-10-03 04:12:50,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:50,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:50,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:50,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:50,822 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 04:12:50,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:50,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:12:50,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:50,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:12:50,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:12:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:12:50,826 INFO L87 Difference]: Start difference. First operand 10907 states and 12529 transitions. Second operand 3 states. [2019-10-03 04:12:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:50,917 INFO L93 Difference]: Finished difference Result 20923 states and 24152 transitions. [2019-10-03 04:12:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:12:50,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-03 04:12:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:50,961 INFO L225 Difference]: With dead ends: 20923 [2019-10-03 04:12:50,961 INFO L226 Difference]: Without dead ends: 20923 [2019-10-03 04:12:50,962 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 04:12:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20923 states. [2019-10-03 04:12:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20923 to 20920. [2019-10-03 04:12:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20920 states. [2019-10-03 04:12:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20920 states to 20920 states and 24150 transitions. [2019-10-03 04:12:51,248 INFO L78 Accepts]: Start accepts. Automaton has 20920 states and 24150 transitions. Word has length 150 [2019-10-03 04:12:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:51,248 INFO L475 AbstractCegarLoop]: Abstraction has 20920 states and 24150 transitions. [2019-10-03 04:12:51,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:12:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 20920 states and 24150 transitions. [2019-10-03 04:12:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-03 04:12:51,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:51,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:51,251 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1244561766, now seen corresponding path program 1 times [2019-10-03 04:12:51,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:51,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:51,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:51,306 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 04:12:51,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:51,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:12:51,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:51,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:12:51,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:12:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:12:51,308 INFO L87 Difference]: Start difference. First operand 20920 states and 24150 transitions. Second operand 3 states. [2019-10-03 04:12:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:51,455 INFO L93 Difference]: Finished difference Result 41132 states and 48625 transitions. [2019-10-03 04:12:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:12:51,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-03 04:12:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:51,559 INFO L225 Difference]: With dead ends: 41132 [2019-10-03 04:12:51,560 INFO L226 Difference]: Without dead ends: 41132 [2019-10-03 04:12:51,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 04:12:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41132 states. [2019-10-03 04:12:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41132 to 41132. [2019-10-03 04:12:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41132 states. [2019-10-03 04:12:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41132 states to 41132 states and 48625 transitions. [2019-10-03 04:12:52,320 INFO L78 Accepts]: Start accepts. Automaton has 41132 states and 48625 transitions. Word has length 151 [2019-10-03 04:12:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:52,321 INFO L475 AbstractCegarLoop]: Abstraction has 41132 states and 48625 transitions. [2019-10-03 04:12:52,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:12:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 41132 states and 48625 transitions. [2019-10-03 04:12:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-03 04:12:52,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:52,329 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:52,329 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:52,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1157336766, now seen corresponding path program 1 times [2019-10-03 04:12:52,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:52,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:52,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:52,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:52,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 04:12:52,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:52,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:12:52,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:52,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:12:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:12:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:12:52,398 INFO L87 Difference]: Start difference. First operand 41132 states and 48625 transitions. Second operand 3 states. [2019-10-03 04:12:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:52,828 INFO L93 Difference]: Finished difference Result 81786 states and 97974 transitions. [2019-10-03 04:12:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:12:52,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-03 04:12:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:53,051 INFO L225 Difference]: With dead ends: 81786 [2019-10-03 04:12:53,052 INFO L226 Difference]: Without dead ends: 61528 [2019-10-03 04:12:53,052 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 04:12:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61528 states. [2019-10-03 04:12:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61528 to 61528. [2019-10-03 04:12:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61528 states. [2019-10-03 04:12:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61528 states to 61528 states and 73148 transitions. [2019-10-03 04:12:55,509 INFO L78 Accepts]: Start accepts. Automaton has 61528 states and 73148 transitions. Word has length 175 [2019-10-03 04:12:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:55,509 INFO L475 AbstractCegarLoop]: Abstraction has 61528 states and 73148 transitions. [2019-10-03 04:12:55,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:12:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 61528 states and 73148 transitions. [2019-10-03 04:12:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-03 04:12:55,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:55,562 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-03 04:12:55,563 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:55,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1003799114, now seen corresponding path program 1 times [2019-10-03 04:12:55,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:55,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:55,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:12:55,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:12:55,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:12:55,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:55,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:12:55,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:12:55,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:12:55,656 INFO L87 Difference]: Start difference. First operand 61528 states and 73148 transitions. Second operand 3 states. [2019-10-03 04:12:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:56,177 INFO L93 Difference]: Finished difference Result 105393 states and 128476 transitions. [2019-10-03 04:12:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:12:56,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-10-03 04:12:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:56,575 INFO L225 Difference]: With dead ends: 105393 [2019-10-03 04:12:56,575 INFO L226 Difference]: Without dead ends: 105393 [2019-10-03 04:12:56,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 04:12:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105393 states. [2019-10-03 04:12:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105393 to 105390. [2019-10-03 04:12:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105390 states. [2019-10-03 04:12:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105390 states to 105390 states and 128474 transitions. [2019-10-03 04:12:59,863 INFO L78 Accepts]: Start accepts. Automaton has 105390 states and 128474 transitions. Word has length 255 [2019-10-03 04:12:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:59,863 INFO L475 AbstractCegarLoop]: Abstraction has 105390 states and 128474 transitions. [2019-10-03 04:12:59,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:12:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 105390 states and 128474 transitions. [2019-10-03 04:12:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-03 04:12:59,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:59,952 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-03 04:12:59,952 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1211931379, now seen corresponding path program 1 times [2019-10-03 04:12:59,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:59,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:59,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-03 04:13:00,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:13:00,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:13:00,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:00,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:13:00,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:13:00,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:13:00,024 INFO L87 Difference]: Start difference. First operand 105390 states and 128474 transitions. Second operand 4 states. [2019-10-03 04:13:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:00,424 INFO L93 Difference]: Finished difference Result 82291 states and 99146 transitions. [2019-10-03 04:13:00,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:13:00,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-10-03 04:13:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:00,635 INFO L225 Difference]: With dead ends: 82291 [2019-10-03 04:13:00,636 INFO L226 Difference]: Without dead ends: 82291 [2019-10-03 04:13:00,636 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 04:13:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82291 states. [2019-10-03 04:13:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82291 to 81072. [2019-10-03 04:13:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81072 states. [2019-10-03 04:13:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81072 states to 81072 states and 97835 transitions. [2019-10-03 04:13:03,742 INFO L78 Accepts]: Start accepts. Automaton has 81072 states and 97835 transitions. Word has length 256 [2019-10-03 04:13:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:03,742 INFO L475 AbstractCegarLoop]: Abstraction has 81072 states and 97835 transitions. [2019-10-03 04:13:03,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:13:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 81072 states and 97835 transitions. [2019-10-03 04:13:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-03 04:13:03,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:03,771 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-03 04:13:03,771 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash 740618575, now seen corresponding path program 1 times [2019-10-03 04:13:03,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:03,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:03,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:03,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:03,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-03 04:13:03,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:13:03,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:13:03,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2019-10-03 04:13:03,876 INFO L207 CegarAbsIntRunner]: [91], [94], [105], [107], [109], [111], [115], [147], [149], [152], [163], [165], [171], [172], [177], [191], [201], [203], [205], [206], [211], [217], [223], [229], [235], [241], [247], [253], [259], [265], [271], [277], [283], [285], [286], [296], [298], [300], [301], [381], [391], [393], [395], [396], [398], [399], [401], [406], [409], [414], [417], [422], [425], [430], [433], [438], [441], [446], [449], [452], [454], [456], [457], [460], [494], [495], [496], [506], [508], [510], [511], [516], [522], [528], [534], [540], [546], [552], [558], [564], [570], [576], [582], [588], [590], [593], [599], [605], [611], [617], [623], [629], [633], [634], [637], [640], [644], [646], [648], [649], [694], [695], [696], [706], [708], [710], [711], [712], [721], [724], [727], [733], [739], [755], [768], [781], [794], [798], [801], [804], [811], [814], [826], [836], [838], [840], [841], [842], [843], [857], [859], [892], [893], [900], [901], [904], [906], [907], [908], [912], [913], [914], [915], [916], [917], [918], [919], [920], [921], [922], [923], [924], [925], [926], [927], [930], [931], [942], [943], [944], [945], [946], [947], [948], [949], [950], [951], [952], [953], [954], [955], [956], [976], [977], [978] [2019-10-03 04:13:03,934 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:13:03,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:13:04,171 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:13:04,173 INFO L272 AbstractInterpreter]: Visited 142 different actions 142 times. Never merged. Never widened. Performed 752 root evaluator evaluations with a maximum evaluation depth of 4. Performed 752 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 82 variables. [2019-10-03 04:13:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:04,178 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:13:04,531 INFO L227 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 64.93% of their original sizes. [2019-10-03 04:13:04,532 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:13:07,102 INFO L420 sIntCurrentIteration]: We unified 255 AI predicates to 255 [2019-10-03 04:13:07,102 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:13:07,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:13:07,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [5] total 67 [2019-10-03 04:13:07,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:07,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-03 04:13:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-03 04:13:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=3272, Unknown=0, NotChecked=0, Total=4032 [2019-10-03 04:13:07,107 INFO L87 Difference]: Start difference. First operand 81072 states and 97835 transitions. Second operand 64 states. [2019-10-03 04:13:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:31,958 INFO L93 Difference]: Finished difference Result 81301 states and 98199 transitions. [2019-10-03 04:13:31,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-03 04:13:31,958 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 256 [2019-10-03 04:13:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:32,171 INFO L225 Difference]: With dead ends: 81301 [2019-10-03 04:13:32,172 INFO L226 Difference]: Without dead ends: 81301 [2019-10-03 04:13:32,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2914 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2201, Invalid=9355, Unknown=0, NotChecked=0, Total=11556 [2019-10-03 04:13:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81301 states. [2019-10-03 04:13:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81301 to 81281. [2019-10-03 04:13:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81281 states. [2019-10-03 04:13:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81281 states to 81281 states and 98178 transitions. [2019-10-03 04:13:33,926 INFO L78 Accepts]: Start accepts. Automaton has 81281 states and 98178 transitions. Word has length 256 [2019-10-03 04:13:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:33,926 INFO L475 AbstractCegarLoop]: Abstraction has 81281 states and 98178 transitions. [2019-10-03 04:13:33,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-03 04:13:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 81281 states and 98178 transitions. [2019-10-03 04:13:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-03 04:13:33,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:33,962 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-03 04:13:33,963 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:33,964 INFO L82 PathProgramCache]: Analyzing trace with hash -939285231, now seen corresponding path program 1 times [2019-10-03 04:13:33,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:33,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:33,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:13:34,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:13:34,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:13:34,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:34,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:13:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:13:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:13:34,067 INFO L87 Difference]: Start difference. First operand 81281 states and 98178 transitions. Second operand 3 states. [2019-10-03 04:13:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:34,551 INFO L93 Difference]: Finished difference Result 118577 states and 147420 transitions. [2019-10-03 04:13:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:13:34,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-03 04:13:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:34,800 INFO L225 Difference]: With dead ends: 118577 [2019-10-03 04:13:34,800 INFO L226 Difference]: Without dead ends: 118577 [2019-10-03 04:13:34,800 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 04:13:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118577 states. [2019-10-03 04:13:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118577 to 118574. [2019-10-03 04:13:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118574 states. [2019-10-03 04:13:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118574 states to 118574 states and 147418 transitions. [2019-10-03 04:13:38,978 INFO L78 Accepts]: Start accepts. Automaton has 118574 states and 147418 transitions. Word has length 260 [2019-10-03 04:13:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:38,978 INFO L475 AbstractCegarLoop]: Abstraction has 118574 states and 147418 transitions. [2019-10-03 04:13:38,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:13:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 118574 states and 147418 transitions. [2019-10-03 04:13:39,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-03 04:13:39,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:39,025 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-03 04:13:39,025 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1825332260, now seen corresponding path program 1 times [2019-10-03 04:13:39,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:39,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:13:39,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:13:39,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:13:39,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:39,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:13:39,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:13:39,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:13:39,119 INFO L87 Difference]: Start difference. First operand 118574 states and 147418 transitions. Second operand 3 states. [2019-10-03 04:13:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:39,966 INFO L93 Difference]: Finished difference Result 172737 states and 224970 transitions. [2019-10-03 04:13:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:13:39,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-03 04:13:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:41,118 INFO L225 Difference]: With dead ends: 172737 [2019-10-03 04:13:41,118 INFO L226 Difference]: Without dead ends: 172737 [2019-10-03 04:13:41,118 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 04:13:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172737 states. [2019-10-03 04:13:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172737 to 172734. [2019-10-03 04:13:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172734 states. [2019-10-03 04:13:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172734 states to 172734 states and 224968 transitions. [2019-10-03 04:13:50,471 INFO L78 Accepts]: Start accepts. Automaton has 172734 states and 224968 transitions. Word has length 261 [2019-10-03 04:13:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:50,471 INFO L475 AbstractCegarLoop]: Abstraction has 172734 states and 224968 transitions. [2019-10-03 04:13:50,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:13:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 172734 states and 224968 transitions. [2019-10-03 04:13:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-03 04:13:50,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:50,516 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-03 04:13:50,516 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:50,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:50,517 INFO L82 PathProgramCache]: Analyzing trace with hash -392687536, now seen corresponding path program 1 times [2019-10-03 04:13:50,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:50,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:50,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:50,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:50,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:13:50,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:13:50,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:13:50,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:50,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:13:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:13:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:13:50,604 INFO L87 Difference]: Start difference. First operand 172734 states and 224968 transitions. Second operand 3 states. [2019-10-03 04:13:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:53,844 INFO L93 Difference]: Finished difference Result 341123 states and 498991 transitions. [2019-10-03 04:13:53,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:13:53,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-10-03 04:13:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:54,728 INFO L225 Difference]: With dead ends: 341123 [2019-10-03 04:13:54,729 INFO L226 Difference]: Without dead ends: 341123 [2019-10-03 04:13:54,729 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 04:13:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341123 states. [2019-10-03 04:14:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341123 to 341060. [2019-10-03 04:14:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341060 states. [2019-10-03 04:14:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341060 states to 341060 states and 498914 transitions. [2019-10-03 04:14:28,275 INFO L78 Accepts]: Start accepts. Automaton has 341060 states and 498914 transitions. Word has length 262 [2019-10-03 04:14:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:14:28,276 INFO L475 AbstractCegarLoop]: Abstraction has 341060 states and 498914 transitions. [2019-10-03 04:14:28,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:14:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 341060 states and 498914 transitions. [2019-10-03 04:14:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-03 04:14:28,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:14:28,382 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-03 04:14:28,382 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:14:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:14:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash -76322659, now seen corresponding path program 1 times [2019-10-03 04:14:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:14:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:14:28,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:14:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:14:28,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:14:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:14:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:14:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:14:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:14:28,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:14:28,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:14:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:14:28,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:14:28,462 INFO L87 Difference]: Start difference. First operand 341060 states and 498914 transitions. Second operand 3 states. [2019-10-03 04:14:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:14:42,763 INFO L93 Difference]: Finished difference Result 523779 states and 903554 transitions. [2019-10-03 04:14:42,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:14:42,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-03 04:14:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:14:44,888 INFO L225 Difference]: With dead ends: 523779 [2019-10-03 04:14:44,888 INFO L226 Difference]: Without dead ends: 523779 [2019-10-03 04:14:44,889 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 04:14:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523779 states. [2019-10-03 04:15:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523779 to 516990. [2019-10-03 04:15:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516990 states. [2019-10-03 04:15:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516990 states to 516990 states and 895563 transitions. [2019-10-03 04:15:52,694 INFO L78 Accepts]: Start accepts. Automaton has 516990 states and 895563 transitions. Word has length 263 [2019-10-03 04:15:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:15:52,694 INFO L475 AbstractCegarLoop]: Abstraction has 516990 states and 895563 transitions. [2019-10-03 04:15:52,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:15:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 516990 states and 895563 transitions. [2019-10-03 04:15:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-03 04:15:52,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:15:52,833 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:52,833 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:15:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash 134256527, now seen corresponding path program 1 times [2019-10-03 04:15:52,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:15:52,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:52,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:52,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:52,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:15:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-03 04:15:52,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:52,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:15:52,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2019-10-03 04:15:52,936 INFO L207 CegarAbsIntRunner]: [91], [94], [105], [107], [109], [111], [115], [147], [149], [152], [163], [165], [171], [172], [177], [191], [201], [203], [205], [206], [211], [217], [223], [229], [235], [241], [247], [253], [259], [265], [271], [277], [283], [285], [286], [296], [298], [300], [301], [381], [391], [393], [395], [396], [398], [399], [401], [406], [409], [414], [417], [422], [425], [430], [433], [438], [441], [446], [449], [452], [454], [456], [457], [460], [494], [495], [496], [506], [508], [510], [511], [516], [522], [528], [534], [540], [546], [552], [558], [564], [570], [576], [582], [588], [590], [593], [599], [605], [611], [617], [623], [629], [633], [634], [637], [640], [644], [646], [648], [649], [694], [695], [696], [706], [708], [710], [711], [712], [721], [724], [727], [733], [739], [746], [752], [759], [765], [772], [778], [785], [791], [798], [801], [804], [811], [814], [826], [836], [838], [840], [841], [842], [843], [857], [859], [892], [893], [900], [901], [904], [906], [907], [908], [912], [913], [914], [915], [916], [917], [918], [919], [920], [921], [922], [923], [924], [925], [926], [927], [930], [931], [942], [943], [944], [945], [946], [947], [948], [949], [950], [951], [952], [953], [954], [955], [956], [976], [977], [978] [2019-10-03 04:15:52,952 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:15:52,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:15:53,103 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:15:53,105 INFO L272 AbstractInterpreter]: Visited 163 different actions 188 times. Merged at 18 different actions 18 times. Never widened. Performed 1268 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1268 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 84 variables. [2019-10-03 04:15:53,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:53,105 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:15:53,365 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 68.53% of their original sizes. [2019-10-03 04:15:53,365 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:15:58,806 INFO L420 sIntCurrentIteration]: We unified 263 AI predicates to 263 [2019-10-03 04:15:58,806 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:15:58,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:15:58,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [87] imperfect sequences [5] total 90 [2019-10-03 04:15:58,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:15:58,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-03 04:15:58,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-03 04:15:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=6041, Unknown=0, NotChecked=0, Total=7482 [2019-10-03 04:15:58,811 INFO L87 Difference]: Start difference. First operand 516990 states and 895563 transitions. Second operand 87 states. [2019-10-03 04:16:50,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:50,010 INFO L93 Difference]: Finished difference Result 676612 states and 1200033 transitions. [2019-10-03 04:16:50,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-03 04:16:50,011 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 264 [2019-10-03 04:16:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:53,940 INFO L225 Difference]: With dead ends: 676612 [2019-10-03 04:16:53,941 INFO L226 Difference]: Without dead ends: 676612 [2019-10-03 04:16:53,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9144 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=5059, Invalid=22997, Unknown=0, NotChecked=0, Total=28056 [2019-10-03 04:16:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676612 states. [2019-10-03 04:18:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676612 to 670083. [2019-10-03 04:18:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670083 states.