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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.08.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:54:08,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:54:08,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:54:08,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:54:08,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:54:08,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:54:08,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:54:08,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:54:08,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:54:08,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:54:08,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:54:08,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:54:08,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:54:08,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:54:08,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:54:08,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:54:08,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:54:08,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:54:08,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:54:08,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:54:08,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:54:08,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:54:08,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:54:08,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:54:08,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:54:08,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:54:08,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:54:08,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:54:08,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:54:08,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:54:08,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:54:08,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:54:08,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:54:08,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:54:08,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:54:08,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:54:08,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:54:08,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:54:08,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:54:08,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:54:08,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:54:08,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:54:08,293 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:54:08,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:54:08,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:54:08,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:54:08,295 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:54:08,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:54:08,296 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:54:08,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:54:08,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:54:08,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:54:08,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:54:08,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:54:08,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:54:08,297 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:54:08,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:54:08,298 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:54:08,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:54:08,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:54:08,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:54:08,299 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:54:08,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:54:08,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:54:08,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:54:08,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:54:08,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:54:08,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:54:08,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:54:08,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:54:08,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:54:08,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:54:08,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:54:08,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:54:08,372 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:54:08,373 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:54:08,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.08.cil.c [2019-09-08 06:54:08,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbaad428/2f23b4e706824f36a1ff5c6fbe14475a/FLAGe357330d8 [2019-09-08 06:54:08,995 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:54:09,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.08.cil.c [2019-09-08 06:54:09,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbaad428/2f23b4e706824f36a1ff5c6fbe14475a/FLAGe357330d8 [2019-09-08 06:54:09,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbaad428/2f23b4e706824f36a1ff5c6fbe14475a [2019-09-08 06:54:09,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:54:09,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:54:09,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:54:09,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:54:09,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:54:09,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:54:09" (1/1) ... [2019-09-08 06:54:09,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511c74e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:09, skipping insertion in model container [2019-09-08 06:54:09,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:54:09" (1/1) ... [2019-09-08 06:54:09,389 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:54:09,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:54:09,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:54:09,882 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:54:09,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:54:10,008 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:54:10,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10 WrapperNode [2019-09-08 06:54:10,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:54:10,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:54:10,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:54:10,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:54:10,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (1/1) ... [2019-09-08 06:54:10,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (1/1) ... [2019-09-08 06:54:10,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (1/1) ... [2019-09-08 06:54:10,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (1/1) ... [2019-09-08 06:54:10,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (1/1) ... [2019-09-08 06:54:10,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (1/1) ... [2019-09-08 06:54:10,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (1/1) ... [2019-09-08 06:54:10,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:54:10,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:54:10,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:54:10,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:54:10,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:54:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:54:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:54:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:54:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:54:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:54:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:54:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:54:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:54:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:54:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:54:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:54:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:54:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:54:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:54:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:54:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:54:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:54:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:54:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:54:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:54:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:54:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:54:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:54:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:54:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:54:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:54:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:54:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:54:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:54:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:54:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:54:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:54:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:54:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:54:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:54:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:54:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:54:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:54:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:54:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:54:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:54:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:54:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:54:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:54:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:54:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:54:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:54:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:54:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:54:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:54:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:54:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:54:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:54:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:54:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:54:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:54:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:54:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:54:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:54:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:54:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:54:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:54:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:54:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:54:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:54:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:54:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:54:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:54:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:54:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:54:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:54:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:54:11,111 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:54:11,111 INFO L283 CfgBuilder]: Removed 12 assume(true) statements. [2019-09-08 06:54:11,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:54:11 BoogieIcfgContainer [2019-09-08 06:54:11,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:54:11,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:54:11,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:54:11,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:54:11,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:54:09" (1/3) ... [2019-09-08 06:54:11,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2bf157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:54:11, skipping insertion in model container [2019-09-08 06:54:11,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:10" (2/3) ... [2019-09-08 06:54:11,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2bf157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:54:11, skipping insertion in model container [2019-09-08 06:54:11,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:54:11" (3/3) ... [2019-09-08 06:54:11,122 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.08.cil.c [2019-09-08 06:54:11,132 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:54:11,140 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:54:11,156 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:54:11,191 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:54:11,192 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:54:11,192 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:54:11,192 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:54:11,192 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:54:11,192 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:54:11,193 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:54:11,193 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:54:11,193 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:54:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states. [2019-09-08 06:54:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:11,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:11,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:11,246 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1426597092, now seen corresponding path program 1 times [2019-09-08 06:54:11,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:11,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:11,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:11,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:11,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:11,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:11,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:11,802 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 4 states. [2019-09-08 06:54:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:12,183 INFO L93 Difference]: Finished difference Result 678 states and 1032 transitions. [2019-09-08 06:54:12,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:12,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-08 06:54:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:12,223 INFO L225 Difference]: With dead ends: 678 [2019-09-08 06:54:12,225 INFO L226 Difference]: Without dead ends: 340 [2019-09-08 06:54:12,242 INFO L628 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-09-08 06:54:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-08 06:54:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2019-09-08 06:54:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 488 transitions. [2019-09-08 06:54:12,361 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 488 transitions. Word has length 180 [2019-09-08 06:54:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:12,363 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 488 transitions. [2019-09-08 06:54:12,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 488 transitions. [2019-09-08 06:54:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:12,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:12,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:12,370 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash 22727906, now seen corresponding path program 1 times [2019-09-08 06:54:12,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:12,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:12,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:12,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:12,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:12,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:12,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:12,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:12,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:12,609 INFO L87 Difference]: Start difference. First operand 340 states and 488 transitions. Second operand 5 states. [2019-09-08 06:54:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:13,488 INFO L93 Difference]: Finished difference Result 706 states and 1038 transitions. [2019-09-08 06:54:13,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:13,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:13,494 INFO L225 Difference]: With dead ends: 706 [2019-09-08 06:54:13,495 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 06:54:13,497 INFO L628 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-09-08 06:54:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 06:54:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 340. [2019-09-08 06:54:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 487 transitions. [2019-09-08 06:54:13,557 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 487 transitions. Word has length 180 [2019-09-08 06:54:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:13,559 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 487 transitions. [2019-09-08 06:54:13,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 487 transitions. [2019-09-08 06:54:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:13,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:13,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:13,566 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:13,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1917061792, now seen corresponding path program 1 times [2019-09-08 06:54:13,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:13,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:13,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:13,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:13,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:13,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:13,809 INFO L87 Difference]: Start difference. First operand 340 states and 487 transitions. Second operand 5 states. [2019-09-08 06:54:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:14,535 INFO L93 Difference]: Finished difference Result 706 states and 1037 transitions. [2019-09-08 06:54:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:14,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:14,539 INFO L225 Difference]: With dead ends: 706 [2019-09-08 06:54:14,540 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 06:54:14,541 INFO L628 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-09-08 06:54:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 06:54:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 340. [2019-09-08 06:54:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 486 transitions. [2019-09-08 06:54:14,563 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 486 transitions. Word has length 180 [2019-09-08 06:54:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:14,564 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 486 transitions. [2019-09-08 06:54:14,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 486 transitions. [2019-09-08 06:54:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:14,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:14,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:14,568 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash -931324638, now seen corresponding path program 1 times [2019-09-08 06:54:14,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:14,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:14,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:14,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:14,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:14,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:14,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:14,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:14,669 INFO L87 Difference]: Start difference. First operand 340 states and 486 transitions. Second operand 5 states. [2019-09-08 06:54:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:15,366 INFO L93 Difference]: Finished difference Result 704 states and 1031 transitions. [2019-09-08 06:54:15,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:15,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:15,370 INFO L225 Difference]: With dead ends: 704 [2019-09-08 06:54:15,370 INFO L226 Difference]: Without dead ends: 390 [2019-09-08 06:54:15,372 INFO L628 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-09-08 06:54:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-08 06:54:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 340. [2019-09-08 06:54:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 485 transitions. [2019-09-08 06:54:15,399 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 485 transitions. Word has length 180 [2019-09-08 06:54:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:15,400 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 485 transitions. [2019-09-08 06:54:15,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 485 transitions. [2019-09-08 06:54:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:15,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:15,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:15,404 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:15,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1854492064, now seen corresponding path program 1 times [2019-09-08 06:54:15,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:15,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:15,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:15,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:15,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:15,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:15,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:15,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:15,525 INFO L87 Difference]: Start difference. First operand 340 states and 485 transitions. Second operand 5 states. [2019-09-08 06:54:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:16,230 INFO L93 Difference]: Finished difference Result 702 states and 1025 transitions. [2019-09-08 06:54:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:16,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:16,235 INFO L225 Difference]: With dead ends: 702 [2019-09-08 06:54:16,236 INFO L226 Difference]: Without dead ends: 388 [2019-09-08 06:54:16,242 INFO L628 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-09-08 06:54:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-08 06:54:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 340. [2019-09-08 06:54:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 484 transitions. [2019-09-08 06:54:16,287 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 484 transitions. Word has length 180 [2019-09-08 06:54:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:16,288 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 484 transitions. [2019-09-08 06:54:16,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 484 transitions. [2019-09-08 06:54:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:16,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:16,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:16,292 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1468629662, now seen corresponding path program 1 times [2019-09-08 06:54:16,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:16,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:16,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:16,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:16,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:16,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:16,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:16,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:16,418 INFO L87 Difference]: Start difference. First operand 340 states and 484 transitions. Second operand 5 states. [2019-09-08 06:54:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:17,215 INFO L93 Difference]: Finished difference Result 700 states and 1019 transitions. [2019-09-08 06:54:17,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:17,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:17,220 INFO L225 Difference]: With dead ends: 700 [2019-09-08 06:54:17,221 INFO L226 Difference]: Without dead ends: 386 [2019-09-08 06:54:17,223 INFO L628 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-09-08 06:54:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-08 06:54:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 340. [2019-09-08 06:54:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 483 transitions. [2019-09-08 06:54:17,256 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 483 transitions. Word has length 180 [2019-09-08 06:54:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:17,257 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 483 transitions. [2019-09-08 06:54:17,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 483 transitions. [2019-09-08 06:54:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:17,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:17,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:17,261 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1733277152, now seen corresponding path program 1 times [2019-09-08 06:54:17,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:17,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:17,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:17,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:17,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:17,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:17,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:17,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:17,385 INFO L87 Difference]: Start difference. First operand 340 states and 483 transitions. Second operand 5 states. [2019-09-08 06:54:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:18,077 INFO L93 Difference]: Finished difference Result 698 states and 1013 transitions. [2019-09-08 06:54:18,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:18,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:18,084 INFO L225 Difference]: With dead ends: 698 [2019-09-08 06:54:18,084 INFO L226 Difference]: Without dead ends: 384 [2019-09-08 06:54:18,086 INFO L628 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-09-08 06:54:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-08 06:54:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 340. [2019-09-08 06:54:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 482 transitions. [2019-09-08 06:54:18,116 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 482 transitions. Word has length 180 [2019-09-08 06:54:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:18,117 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 482 transitions. [2019-09-08 06:54:18,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 482 transitions. [2019-09-08 06:54:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:18,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:18,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:18,121 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:18,121 INFO L82 PathProgramCache]: Analyzing trace with hash 197848482, now seen corresponding path program 1 times [2019-09-08 06:54:18,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:18,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:18,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:18,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:18,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:18,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:18,222 INFO L87 Difference]: Start difference. First operand 340 states and 482 transitions. Second operand 5 states. [2019-09-08 06:54:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:19,017 INFO L93 Difference]: Finished difference Result 694 states and 1003 transitions. [2019-09-08 06:54:19,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:19,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:19,020 INFO L225 Difference]: With dead ends: 694 [2019-09-08 06:54:19,020 INFO L226 Difference]: Without dead ends: 380 [2019-09-08 06:54:19,022 INFO L628 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-09-08 06:54:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-08 06:54:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 340. [2019-09-08 06:54:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 481 transitions. [2019-09-08 06:54:19,046 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 481 transitions. Word has length 180 [2019-09-08 06:54:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:19,046 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 481 transitions. [2019-09-08 06:54:19,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 481 transitions. [2019-09-08 06:54:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:19,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:19,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:19,049 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:19,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:19,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2094827940, now seen corresponding path program 1 times [2019-09-08 06:54:19,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:19,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:19,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:19,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:19,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:19,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:19,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:19,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:19,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:19,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:19,140 INFO L87 Difference]: Start difference. First operand 340 states and 481 transitions. Second operand 5 states. [2019-09-08 06:54:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:19,884 INFO L93 Difference]: Finished difference Result 692 states and 997 transitions. [2019-09-08 06:54:19,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:19,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:19,890 INFO L225 Difference]: With dead ends: 692 [2019-09-08 06:54:19,890 INFO L226 Difference]: Without dead ends: 378 [2019-09-08 06:54:19,894 INFO L628 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-09-08 06:54:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-08 06:54:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 340. [2019-09-08 06:54:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 480 transitions. [2019-09-08 06:54:19,931 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 480 transitions. Word has length 180 [2019-09-08 06:54:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:19,934 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 480 transitions. [2019-09-08 06:54:19,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 480 transitions. [2019-09-08 06:54:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:19,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:19,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:19,937 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:19,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:19,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1861851806, now seen corresponding path program 1 times [2019-09-08 06:54:19,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:19,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:19,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:19,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:19,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:20,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:20,051 INFO L87 Difference]: Start difference. First operand 340 states and 480 transitions. Second operand 5 states. [2019-09-08 06:54:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:20,788 INFO L93 Difference]: Finished difference Result 727 states and 1059 transitions. [2019-09-08 06:54:20,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:20,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:20,794 INFO L225 Difference]: With dead ends: 727 [2019-09-08 06:54:20,794 INFO L226 Difference]: Without dead ends: 413 [2019-09-08 06:54:20,796 INFO L628 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-09-08 06:54:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-08 06:54:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 340. [2019-09-08 06:54:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 479 transitions. [2019-09-08 06:54:20,835 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 479 transitions. Word has length 180 [2019-09-08 06:54:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:20,836 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 479 transitions. [2019-09-08 06:54:20,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 479 transitions. [2019-09-08 06:54:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:20,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:20,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:20,840 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1435297308, now seen corresponding path program 1 times [2019-09-08 06:54:20,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:20,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:20,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:20,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:20,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:20,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:20,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:20,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:20,977 INFO L87 Difference]: Start difference. First operand 340 states and 479 transitions. Second operand 5 states. [2019-09-08 06:54:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:21,689 INFO L93 Difference]: Finished difference Result 725 states and 1053 transitions. [2019-09-08 06:54:21,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:21,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:21,694 INFO L225 Difference]: With dead ends: 725 [2019-09-08 06:54:21,694 INFO L226 Difference]: Without dead ends: 411 [2019-09-08 06:54:21,696 INFO L628 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-09-08 06:54:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-08 06:54:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 340. [2019-09-08 06:54:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 478 transitions. [2019-09-08 06:54:21,729 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 478 transitions. Word has length 180 [2019-09-08 06:54:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:21,730 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 478 transitions. [2019-09-08 06:54:21,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 478 transitions. [2019-09-08 06:54:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:21,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:21,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:21,734 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:21,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1975726814, now seen corresponding path program 1 times [2019-09-08 06:54:21,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:21,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:21,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:21,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:21,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:21,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:21,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:21,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:21,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:21,818 INFO L87 Difference]: Start difference. First operand 340 states and 478 transitions. Second operand 5 states. [2019-09-08 06:54:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:22,546 INFO L93 Difference]: Finished difference Result 723 states and 1047 transitions. [2019-09-08 06:54:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:22,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:22,550 INFO L225 Difference]: With dead ends: 723 [2019-09-08 06:54:22,551 INFO L226 Difference]: Without dead ends: 409 [2019-09-08 06:54:22,552 INFO L628 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-09-08 06:54:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-09-08 06:54:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 340. [2019-09-08 06:54:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 477 transitions. [2019-09-08 06:54:22,584 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 477 transitions. Word has length 180 [2019-09-08 06:54:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:22,585 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 477 transitions. [2019-09-08 06:54:22,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 477 transitions. [2019-09-08 06:54:22,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:22,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:22,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:22,587 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:22,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2131707356, now seen corresponding path program 1 times [2019-09-08 06:54:22,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:22,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:22,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:22,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:22,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:22,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:22,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:22,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:22,690 INFO L87 Difference]: Start difference. First operand 340 states and 477 transitions. Second operand 5 states. [2019-09-08 06:54:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:23,320 INFO L93 Difference]: Finished difference Result 721 states and 1041 transitions. [2019-09-08 06:54:23,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:23,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:23,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:23,324 INFO L225 Difference]: With dead ends: 721 [2019-09-08 06:54:23,325 INFO L226 Difference]: Without dead ends: 407 [2019-09-08 06:54:23,327 INFO L628 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-09-08 06:54:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-08 06:54:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 340. [2019-09-08 06:54:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 476 transitions. [2019-09-08 06:54:23,362 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 476 transitions. Word has length 180 [2019-09-08 06:54:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:23,363 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 476 transitions. [2019-09-08 06:54:23,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 476 transitions. [2019-09-08 06:54:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:23,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:23,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:23,365 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1721096990, now seen corresponding path program 1 times [2019-09-08 06:54:23,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:23,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:23,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:23,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:23,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:23,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:23,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:23,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:23,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:23,447 INFO L87 Difference]: Start difference. First operand 340 states and 476 transitions. Second operand 5 states. [2019-09-08 06:54:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:24,113 INFO L93 Difference]: Finished difference Result 719 states and 1035 transitions. [2019-09-08 06:54:24,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:24,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:24,117 INFO L225 Difference]: With dead ends: 719 [2019-09-08 06:54:24,118 INFO L226 Difference]: Without dead ends: 405 [2019-09-08 06:54:24,120 INFO L628 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-09-08 06:54:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-08 06:54:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 340. [2019-09-08 06:54:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 475 transitions. [2019-09-08 06:54:24,182 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 475 transitions. Word has length 180 [2019-09-08 06:54:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:24,182 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 475 transitions. [2019-09-08 06:54:24,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 475 transitions. [2019-09-08 06:54:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:24,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:24,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:24,184 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash 786000484, now seen corresponding path program 1 times [2019-09-08 06:54:24,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:24,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:24,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:24,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:24,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:24,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:24,271 INFO L87 Difference]: Start difference. First operand 340 states and 475 transitions. Second operand 5 states. [2019-09-08 06:54:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:25,091 INFO L93 Difference]: Finished difference Result 715 states and 1025 transitions. [2019-09-08 06:54:25,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:25,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:25,096 INFO L225 Difference]: With dead ends: 715 [2019-09-08 06:54:25,096 INFO L226 Difference]: Without dead ends: 401 [2019-09-08 06:54:25,098 INFO L628 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-09-08 06:54:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-09-08 06:54:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 340. [2019-09-08 06:54:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 474 transitions. [2019-09-08 06:54:25,140 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 474 transitions. Word has length 180 [2019-09-08 06:54:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:25,141 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 474 transitions. [2019-09-08 06:54:25,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 474 transitions. [2019-09-08 06:54:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:25,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:25,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:25,143 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash 855648358, now seen corresponding path program 1 times [2019-09-08 06:54:25,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:25,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:25,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:25,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:25,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:25,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:25,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:25,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:25,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:25,242 INFO L87 Difference]: Start difference. First operand 340 states and 474 transitions. Second operand 5 states. [2019-09-08 06:54:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:25,976 INFO L93 Difference]: Finished difference Result 713 states and 1019 transitions. [2019-09-08 06:54:25,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:25,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-08 06:54:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:25,981 INFO L225 Difference]: With dead ends: 713 [2019-09-08 06:54:25,981 INFO L226 Difference]: Without dead ends: 399 [2019-09-08 06:54:25,983 INFO L628 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-09-08 06:54:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-08 06:54:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 340. [2019-09-08 06:54:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-08 06:54:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 473 transitions. [2019-09-08 06:54:26,107 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 473 transitions. Word has length 180 [2019-09-08 06:54:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:26,107 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 473 transitions. [2019-09-08 06:54:26,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 473 transitions. [2019-09-08 06:54:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:26,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:26,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:26,111 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:26,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1273537060, now seen corresponding path program 1 times [2019-09-08 06:54:26,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:26,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:26,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:26,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:26,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:26,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:26,243 INFO L87 Difference]: Start difference. First operand 340 states and 473 transitions. Second operand 4 states. [2019-09-08 06:54:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:26,734 INFO L93 Difference]: Finished difference Result 958 states and 1376 transitions. [2019-09-08 06:54:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:26,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-08 06:54:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:26,740 INFO L225 Difference]: With dead ends: 958 [2019-09-08 06:54:26,740 INFO L226 Difference]: Without dead ends: 645 [2019-09-08 06:54:26,744 INFO L628 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-09-08 06:54:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-08 06:54:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 640. [2019-09-08 06:54:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-08 06:54:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 890 transitions. [2019-09-08 06:54:26,869 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 890 transitions. Word has length 180 [2019-09-08 06:54:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:26,869 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 890 transitions. [2019-09-08 06:54:26,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 890 transitions. [2019-09-08 06:54:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:26,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:26,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:26,873 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash 496007525, now seen corresponding path program 1 times [2019-09-08 06:54:26,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:26,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:26,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:26,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:26,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:27,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:27,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:27,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:27,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:27,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:27,011 INFO L87 Difference]: Start difference. First operand 640 states and 890 transitions. Second operand 4 states. [2019-09-08 06:54:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:27,634 INFO L93 Difference]: Finished difference Result 1853 states and 2662 transitions. [2019-09-08 06:54:27,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:27,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-08 06:54:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:27,646 INFO L225 Difference]: With dead ends: 1853 [2019-09-08 06:54:27,646 INFO L226 Difference]: Without dead ends: 1240 [2019-09-08 06:54:27,652 INFO L628 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-09-08 06:54:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-09-08 06:54:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1233. [2019-09-08 06:54:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-09-08 06:54:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1713 transitions. [2019-09-08 06:54:27,870 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1713 transitions. Word has length 180 [2019-09-08 06:54:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:27,871 INFO L475 AbstractCegarLoop]: Abstraction has 1233 states and 1713 transitions. [2019-09-08 06:54:27,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1713 transitions. [2019-09-08 06:54:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:27,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:27,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:27,875 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:27,876 INFO L82 PathProgramCache]: Analyzing trace with hash -732281596, now seen corresponding path program 1 times [2019-09-08 06:54:27,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:27,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:27,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:27,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:27,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:28,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:28,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:28,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:28,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:28,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:28,008 INFO L87 Difference]: Start difference. First operand 1233 states and 1713 transitions. Second operand 6 states. [2019-09-08 06:54:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:28,277 INFO L93 Difference]: Finished difference Result 2495 states and 3556 transitions. [2019-09-08 06:54:28,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:28,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 06:54:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:28,288 INFO L225 Difference]: With dead ends: 2495 [2019-09-08 06:54:28,288 INFO L226 Difference]: Without dead ends: 1289 [2019-09-08 06:54:28,296 INFO L628 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-09-08 06:54:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-09-08 06:54:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1243. [2019-09-08 06:54:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-09-08 06:54:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1721 transitions. [2019-09-08 06:54:28,493 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1721 transitions. Word has length 180 [2019-09-08 06:54:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:28,493 INFO L475 AbstractCegarLoop]: Abstraction has 1243 states and 1721 transitions. [2019-09-08 06:54:28,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1721 transitions. [2019-09-08 06:54:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:28,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:28,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:28,497 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1269604674, now seen corresponding path program 1 times [2019-09-08 06:54:28,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:28,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:28,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:28,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:28,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:28,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:28,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:28,615 INFO L87 Difference]: Start difference. First operand 1243 states and 1721 transitions. Second operand 4 states. [2019-09-08 06:54:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:29,182 INFO L93 Difference]: Finished difference Result 3650 states and 5225 transitions. [2019-09-08 06:54:29,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:29,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-08 06:54:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:29,203 INFO L225 Difference]: With dead ends: 3650 [2019-09-08 06:54:29,204 INFO L226 Difference]: Without dead ends: 2434 [2019-09-08 06:54:29,213 INFO L628 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-09-08 06:54:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2019-09-08 06:54:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2423. [2019-09-08 06:54:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-09-08 06:54:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3353 transitions. [2019-09-08 06:54:29,569 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3353 transitions. Word has length 180 [2019-09-08 06:54:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:29,569 INFO L475 AbstractCegarLoop]: Abstraction has 2423 states and 3353 transitions. [2019-09-08 06:54:29,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3353 transitions. [2019-09-08 06:54:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:29,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:29,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:29,572 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:29,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash -595368287, now seen corresponding path program 1 times [2019-09-08 06:54:29,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:29,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:29,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:29,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:29,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:29,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:29,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:29,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:29,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:29,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:29,670 INFO L87 Difference]: Start difference. First operand 2423 states and 3353 transitions. Second operand 6 states. [2019-09-08 06:54:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:29,917 INFO L93 Difference]: Finished difference Result 4907 states and 6964 transitions. [2019-09-08 06:54:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:29,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 06:54:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:29,934 INFO L225 Difference]: With dead ends: 4907 [2019-09-08 06:54:29,934 INFO L226 Difference]: Without dead ends: 2511 [2019-09-08 06:54:29,947 INFO L628 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-09-08 06:54:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2019-09-08 06:54:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2443. [2019-09-08 06:54:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2019-09-08 06:54:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3369 transitions. [2019-09-08 06:54:30,214 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3369 transitions. Word has length 180 [2019-09-08 06:54:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:30,215 INFO L475 AbstractCegarLoop]: Abstraction has 2443 states and 3369 transitions. [2019-09-08 06:54:30,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3369 transitions. [2019-09-08 06:54:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:30,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:30,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:30,217 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1652099489, now seen corresponding path program 1 times [2019-09-08 06:54:30,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:30,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:30,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:30,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:30,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:30,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:30,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:30,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:30,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:30,305 INFO L87 Difference]: Start difference. First operand 2443 states and 3369 transitions. Second operand 6 states. [2019-09-08 06:54:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:30,587 INFO L93 Difference]: Finished difference Result 4987 states and 7057 transitions. [2019-09-08 06:54:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:30,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 06:54:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:30,607 INFO L225 Difference]: With dead ends: 4987 [2019-09-08 06:54:30,607 INFO L226 Difference]: Without dead ends: 2571 [2019-09-08 06:54:30,620 INFO L628 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-09-08 06:54:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-09-08 06:54:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2483. [2019-09-08 06:54:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2483 states. [2019-09-08 06:54:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3409 transitions. [2019-09-08 06:54:30,997 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3409 transitions. Word has length 180 [2019-09-08 06:54:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:30,998 INFO L475 AbstractCegarLoop]: Abstraction has 2483 states and 3409 transitions. [2019-09-08 06:54:30,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3409 transitions. [2019-09-08 06:54:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:31,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:31,002 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:31,002 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash -813065827, now seen corresponding path program 1 times [2019-09-08 06:54:31,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:31,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:31,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:31,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:31,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:31,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:31,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:31,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:31,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:31,128 INFO L87 Difference]: Start difference. First operand 2483 states and 3409 transitions. Second operand 4 states. [2019-09-08 06:54:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:31,895 INFO L93 Difference]: Finished difference Result 7346 states and 10439 transitions. [2019-09-08 06:54:31,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:31,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-08 06:54:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:31,937 INFO L225 Difference]: With dead ends: 7346 [2019-09-08 06:54:31,937 INFO L226 Difference]: Without dead ends: 4890 [2019-09-08 06:54:31,958 INFO L628 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-09-08 06:54:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2019-09-08 06:54:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4871. [2019-09-08 06:54:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4871 states. [2019-09-08 06:54:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 6691 transitions. [2019-09-08 06:54:32,940 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 6691 transitions. Word has length 180 [2019-09-08 06:54:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:32,941 INFO L475 AbstractCegarLoop]: Abstraction has 4871 states and 6691 transitions. [2019-09-08 06:54:32,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 6691 transitions. [2019-09-08 06:54:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:32,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:32,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:32,945 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash -671966306, now seen corresponding path program 1 times [2019-09-08 06:54:32,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:32,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:32,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:32,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:33,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:33,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:33,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:33,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:33,127 INFO L87 Difference]: Start difference. First operand 4871 states and 6691 transitions. Second operand 4 states. [2019-09-08 06:54:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:35,123 INFO L93 Difference]: Finished difference Result 14462 states and 20623 transitions. [2019-09-08 06:54:35,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:35,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-08 06:54:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:35,223 INFO L225 Difference]: With dead ends: 14462 [2019-09-08 06:54:35,224 INFO L226 Difference]: Without dead ends: 9618 [2019-09-08 06:54:35,273 INFO L628 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-09-08 06:54:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2019-09-08 06:54:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 9583. [2019-09-08 06:54:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9583 states. [2019-09-08 06:54:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9583 states to 9583 states and 13197 transitions. [2019-09-08 06:54:37,814 INFO L78 Accepts]: Start accepts. Automaton has 9583 states and 13197 transitions. Word has length 180 [2019-09-08 06:54:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:37,814 INFO L475 AbstractCegarLoop]: Abstraction has 9583 states and 13197 transitions. [2019-09-08 06:54:37,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 9583 states and 13197 transitions. [2019-09-08 06:54:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:37,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:37,817 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:37,818 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1849940867, now seen corresponding path program 1 times [2019-09-08 06:54:37,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:37,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:37,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:37,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:37,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:37,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:37,955 INFO L87 Difference]: Start difference. First operand 9583 states and 13197 transitions. Second operand 6 states. [2019-09-08 06:54:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:38,965 INFO L93 Difference]: Finished difference Result 19299 states and 27288 transitions. [2019-09-08 06:54:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:38,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 06:54:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:39,060 INFO L225 Difference]: With dead ends: 19299 [2019-09-08 06:54:39,060 INFO L226 Difference]: Without dead ends: 9743 [2019-09-08 06:54:39,117 INFO L628 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-09-08 06:54:39,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9743 states. [2019-09-08 06:54:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9743 to 9663. [2019-09-08 06:54:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9663 states. [2019-09-08 06:54:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9663 states to 9663 states and 13261 transitions. [2019-09-08 06:54:40,402 INFO L78 Accepts]: Start accepts. Automaton has 9663 states and 13261 transitions. Word has length 180 [2019-09-08 06:54:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:40,402 INFO L475 AbstractCegarLoop]: Abstraction has 9663 states and 13261 transitions. [2019-09-08 06:54:40,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 9663 states and 13261 transitions. [2019-09-08 06:54:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 06:54:40,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:40,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:40,407 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1648116933, now seen corresponding path program 1 times [2019-09-08 06:54:40,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:40,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:40,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:40,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:40,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:40,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-09-08 06:54:40,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:40,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:40,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:40,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:40,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:40,497 INFO L87 Difference]: Start difference. First operand 9663 states and 13261 transitions. Second operand 4 states. [2019-09-08 06:54:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:42,832 INFO L93 Difference]: Finished difference Result 28771 states and 41233 transitions. [2019-09-08 06:54:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:42,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-08 06:54:42,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:42,939 INFO L225 Difference]: With dead ends: 28771 [2019-09-08 06:54:42,939 INFO L226 Difference]: Without dead ends: 19135 [2019-09-08 06:54:42,989 INFO L628 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-09-08 06:54:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19135 states. [2019-09-08 06:54:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19135 to 19042. [2019-09-08 06:54:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19042 states. [2019-09-08 06:54:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19042 states to 19042 states and 26278 transitions. [2019-09-08 06:54:44,888 INFO L78 Accepts]: Start accepts. Automaton has 19042 states and 26278 transitions. Word has length 180 [2019-09-08 06:54:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:44,888 INFO L475 AbstractCegarLoop]: Abstraction has 19042 states and 26278 transitions. [2019-09-08 06:54:44,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19042 states and 26278 transitions. [2019-09-08 06:54:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:54:44,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:44,895 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:44,896 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1890903621, now seen corresponding path program 1 times [2019-09-08 06:54:44,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:44,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:44,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:44,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:54:44,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:45,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:45,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:45,196 INFO L87 Difference]: Start difference. First operand 19042 states and 26278 transitions. Second operand 5 states. [2019-09-08 06:54:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:48,035 INFO L93 Difference]: Finished difference Result 46824 states and 66250 transitions. [2019-09-08 06:54:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:54:48,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:54:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:48,176 INFO L225 Difference]: With dead ends: 46824 [2019-09-08 06:54:48,177 INFO L226 Difference]: Without dead ends: 27810 [2019-09-08 06:54:48,261 INFO L628 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-09-08 06:54:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27810 states. [2019-09-08 06:54:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27810 to 26210. [2019-09-08 06:54:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26210 states. [2019-09-08 06:54:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26210 states to 26210 states and 34950 transitions. [2019-09-08 06:54:51,567 INFO L78 Accepts]: Start accepts. Automaton has 26210 states and 34950 transitions. Word has length 205 [2019-09-08 06:54:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:51,567 INFO L475 AbstractCegarLoop]: Abstraction has 26210 states and 34950 transitions. [2019-09-08 06:54:51,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 26210 states and 34950 transitions. [2019-09-08 06:54:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:54:51,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:51,576 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:51,576 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1814002823, now seen corresponding path program 1 times [2019-09-08 06:54:51,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:51,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:51,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:51,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:51,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:54:51,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:51,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:51,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:51,667 INFO L87 Difference]: Start difference. First operand 26210 states and 34950 transitions. Second operand 5 states. [2019-09-08 06:54:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:53,932 INFO L93 Difference]: Finished difference Result 52392 states and 70053 transitions. [2019-09-08 06:54:53,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:53,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:54:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:54,058 INFO L225 Difference]: With dead ends: 52392 [2019-09-08 06:54:54,059 INFO L226 Difference]: Without dead ends: 26210 [2019-09-08 06:54:54,138 INFO L628 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-09-08 06:54:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26210 states. [2019-09-08 06:54:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26210 to 26210. [2019-09-08 06:54:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26210 states. [2019-09-08 06:54:56,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26210 states to 26210 states and 34790 transitions. [2019-09-08 06:54:56,315 INFO L78 Accepts]: Start accepts. Automaton has 26210 states and 34790 transitions. Word has length 205 [2019-09-08 06:54:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:56,315 INFO L475 AbstractCegarLoop]: Abstraction has 26210 states and 34790 transitions. [2019-09-08 06:54:56,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 26210 states and 34790 transitions. [2019-09-08 06:54:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:54:56,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:56,324 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:56,324 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1513613819, now seen corresponding path program 1 times [2019-09-08 06:54:56,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:56,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:54:56,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:56,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:56,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:56,433 INFO L87 Difference]: Start difference. First operand 26210 states and 34790 transitions. Second operand 5 states. [2019-09-08 06:54:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:58,789 INFO L93 Difference]: Finished difference Result 52392 states and 69733 transitions. [2019-09-08 06:54:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:58,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:54:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:58,894 INFO L225 Difference]: With dead ends: 52392 [2019-09-08 06:54:58,894 INFO L226 Difference]: Without dead ends: 26210 [2019-09-08 06:54:58,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26210 states. [2019-09-08 06:55:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26210 to 26210. [2019-09-08 06:55:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26210 states. [2019-09-08 06:55:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26210 states to 26210 states and 34630 transitions. [2019-09-08 06:55:01,933 INFO L78 Accepts]: Start accepts. Automaton has 26210 states and 34630 transitions. Word has length 205 [2019-09-08 06:55:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:01,934 INFO L475 AbstractCegarLoop]: Abstraction has 26210 states and 34630 transitions. [2019-09-08 06:55:01,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 26210 states and 34630 transitions. [2019-09-08 06:55:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:01,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:01,940 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:01,940 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash -872895687, now seen corresponding path program 1 times [2019-09-08 06:55:01,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:01,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:01,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:01,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:01,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:02,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:02,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:02,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:02,032 INFO L87 Difference]: Start difference. First operand 26210 states and 34630 transitions. Second operand 5 states. [2019-09-08 06:55:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:04,372 INFO L93 Difference]: Finished difference Result 52392 states and 69413 transitions. [2019-09-08 06:55:04,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:04,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:55:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:04,472 INFO L225 Difference]: With dead ends: 52392 [2019-09-08 06:55:04,472 INFO L226 Difference]: Without dead ends: 26210 [2019-09-08 06:55:04,528 INFO L628 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-09-08 06:55:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26210 states. [2019-09-08 06:55:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26210 to 26210. [2019-09-08 06:55:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26210 states. [2019-09-08 06:55:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26210 states to 26210 states and 34470 transitions. [2019-09-08 06:55:06,434 INFO L78 Accepts]: Start accepts. Automaton has 26210 states and 34470 transitions. Word has length 205 [2019-09-08 06:55:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:06,434 INFO L475 AbstractCegarLoop]: Abstraction has 26210 states and 34470 transitions. [2019-09-08 06:55:06,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 26210 states and 34470 transitions. [2019-09-08 06:55:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:06,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:06,441 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:06,441 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:06,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1365521861, now seen corresponding path program 1 times [2019-09-08 06:55:06,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:06,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:06,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:06,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:06,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:06,559 INFO L87 Difference]: Start difference. First operand 26210 states and 34470 transitions. Second operand 5 states. [2019-09-08 06:55:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:09,845 INFO L93 Difference]: Finished difference Result 52392 states and 69093 transitions. [2019-09-08 06:55:09,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:09,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:55:09,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:09,926 INFO L225 Difference]: With dead ends: 52392 [2019-09-08 06:55:09,926 INFO L226 Difference]: Without dead ends: 26210 [2019-09-08 06:55:09,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:55:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26210 states. [2019-09-08 06:55:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26210 to 26210. [2019-09-08 06:55:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26210 states. [2019-09-08 06:55:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26210 states to 26210 states and 34310 transitions. [2019-09-08 06:55:11,659 INFO L78 Accepts]: Start accepts. Automaton has 26210 states and 34310 transitions. Word has length 205 [2019-09-08 06:55:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:11,659 INFO L475 AbstractCegarLoop]: Abstraction has 26210 states and 34310 transitions. [2019-09-08 06:55:11,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26210 states and 34310 transitions. [2019-09-08 06:55:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:11,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:11,667 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:11,667 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1713291709, now seen corresponding path program 1 times [2019-09-08 06:55:11,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:11,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:11,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:11,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:11,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:11,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:11,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:11,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:11,753 INFO L87 Difference]: Start difference. First operand 26210 states and 34310 transitions. Second operand 5 states. [2019-09-08 06:55:15,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:15,022 INFO L93 Difference]: Finished difference Result 62250 states and 82276 transitions. [2019-09-08 06:55:15,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:15,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:55:15,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:15,134 INFO L225 Difference]: With dead ends: 62250 [2019-09-08 06:55:15,134 INFO L226 Difference]: Without dead ends: 36068 [2019-09-08 06:55:15,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-09-08 06:55:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36068 states. [2019-09-08 06:55:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36068 to 34884. [2019-09-08 06:55:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34884 states. [2019-09-08 06:55:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34884 states to 34884 states and 44748 transitions. [2019-09-08 06:55:17,643 INFO L78 Accepts]: Start accepts. Automaton has 34884 states and 44748 transitions. Word has length 205 [2019-09-08 06:55:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:17,644 INFO L475 AbstractCegarLoop]: Abstraction has 34884 states and 44748 transitions. [2019-09-08 06:55:17,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 34884 states and 44748 transitions. [2019-09-08 06:55:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:17,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:17,648 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:17,649 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:17,649 INFO L82 PathProgramCache]: Analyzing trace with hash 981324283, now seen corresponding path program 1 times [2019-09-08 06:55:17,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:17,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:17,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:17,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:17,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:17,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:17,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:17,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:17,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:17,737 INFO L87 Difference]: Start difference. First operand 34884 states and 44748 transitions. Second operand 5 states. [2019-09-08 06:55:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:21,424 INFO L93 Difference]: Finished difference Result 69738 states and 89773 transitions. [2019-09-08 06:55:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:21,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:55:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:21,525 INFO L225 Difference]: With dead ends: 69738 [2019-09-08 06:55:21,526 INFO L226 Difference]: Without dead ends: 34884 [2019-09-08 06:55:21,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:55:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34884 states. [2019-09-08 06:55:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34884 to 34884. [2019-09-08 06:55:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34884 states. [2019-09-08 06:55:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34884 states to 34884 states and 44524 transitions. [2019-09-08 06:55:23,942 INFO L78 Accepts]: Start accepts. Automaton has 34884 states and 44524 transitions. Word has length 205 [2019-09-08 06:55:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:23,943 INFO L475 AbstractCegarLoop]: Abstraction has 34884 states and 44524 transitions. [2019-09-08 06:55:23,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 34884 states and 44524 transitions. [2019-09-08 06:55:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:23,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:23,949 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:23,950 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash -704855555, now seen corresponding path program 1 times [2019-09-08 06:55:23,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:23,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:23,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:23,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:23,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:24,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:24,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:24,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:24,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:24,052 INFO L87 Difference]: Start difference. First operand 34884 states and 44524 transitions. Second operand 5 states. [2019-09-08 06:55:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:27,176 INFO L93 Difference]: Finished difference Result 69738 states and 89325 transitions. [2019-09-08 06:55:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:27,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:55:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:27,300 INFO L225 Difference]: With dead ends: 69738 [2019-09-08 06:55:27,301 INFO L226 Difference]: Without dead ends: 34884 [2019-09-08 06:55:27,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:55:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34884 states. [2019-09-08 06:55:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34884 to 34884. [2019-09-08 06:55:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34884 states. [2019-09-08 06:55:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34884 states to 34884 states and 44300 transitions. [2019-09-08 06:55:31,289 INFO L78 Accepts]: Start accepts. Automaton has 34884 states and 44300 transitions. Word has length 205 [2019-09-08 06:55:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:31,290 INFO L475 AbstractCegarLoop]: Abstraction has 34884 states and 44300 transitions. [2019-09-08 06:55:31,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34884 states and 44300 transitions. [2019-09-08 06:55:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:31,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:31,297 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:31,297 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:31,297 INFO L82 PathProgramCache]: Analyzing trace with hash -759248453, now seen corresponding path program 1 times [2019-09-08 06:55:31,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:31,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:31,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:31,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:31,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:31,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:31,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:31,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:31,390 INFO L87 Difference]: Start difference. First operand 34884 states and 44300 transitions. Second operand 5 states. [2019-09-08 06:55:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:34,954 INFO L93 Difference]: Finished difference Result 73707 states and 95292 transitions. [2019-09-08 06:55:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:34,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:55:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:35,056 INFO L225 Difference]: With dead ends: 73707 [2019-09-08 06:55:35,056 INFO L226 Difference]: Without dead ends: 38853 [2019-09-08 06:55:35,120 INFO L628 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-09-08 06:55:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38853 states. [2019-09-08 06:55:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38853 to 38836. [2019-09-08 06:55:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38836 states. [2019-09-08 06:55:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38836 states to 38836 states and 49212 transitions. [2019-09-08 06:55:37,878 INFO L78 Accepts]: Start accepts. Automaton has 38836 states and 49212 transitions. Word has length 205 [2019-09-08 06:55:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:37,878 INFO L475 AbstractCegarLoop]: Abstraction has 38836 states and 49212 transitions. [2019-09-08 06:55:37,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 38836 states and 49212 transitions. [2019-09-08 06:55:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:37,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:37,883 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:37,883 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:37,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1176645059, now seen corresponding path program 1 times [2019-09-08 06:55:37,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:37,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:37,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:37,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:37,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:37,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:37,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:37,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:37,984 INFO L87 Difference]: Start difference. First operand 38836 states and 49212 transitions. Second operand 5 states. [2019-09-08 06:55:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:43,277 INFO L93 Difference]: Finished difference Result 85797 states and 113381 transitions. [2019-09-08 06:55:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:43,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:55:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:43,431 INFO L225 Difference]: With dead ends: 85797 [2019-09-08 06:55:43,432 INFO L226 Difference]: Without dead ends: 46989 [2019-09-08 06:55:43,544 INFO L628 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-09-08 06:55:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46989 states. [2019-09-08 06:55:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46989 to 42276. [2019-09-08 06:55:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42276 states. [2019-09-08 06:55:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42276 states to 42276 states and 52716 transitions. [2019-09-08 06:55:46,749 INFO L78 Accepts]: Start accepts. Automaton has 42276 states and 52716 transitions. Word has length 205 [2019-09-08 06:55:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:46,750 INFO L475 AbstractCegarLoop]: Abstraction has 42276 states and 52716 transitions. [2019-09-08 06:55:46,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 42276 states and 52716 transitions. [2019-09-08 06:55:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:46,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:46,755 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:46,755 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash -497372805, now seen corresponding path program 1 times [2019-09-08 06:55:46,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:46,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:46,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:46,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:46,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:46,846 INFO L87 Difference]: Start difference. First operand 42276 states and 52716 transitions. Second operand 5 states. [2019-09-08 06:55:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:53,559 INFO L93 Difference]: Finished difference Result 95003 states and 125317 transitions. [2019-09-08 06:55:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:53,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:55:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:53,705 INFO L225 Difference]: With dead ends: 95003 [2019-09-08 06:55:53,705 INFO L226 Difference]: Without dead ends: 52757 [2019-09-08 06:55:53,776 INFO L628 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-09-08 06:55:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52757 states. [2019-09-08 06:55:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52757 to 48036. [2019-09-08 06:55:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48036 states. [2019-09-08 06:55:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48036 states to 48036 states and 58924 transitions. [2019-09-08 06:55:57,264 INFO L78 Accepts]: Start accepts. Automaton has 48036 states and 58924 transitions. Word has length 205 [2019-09-08 06:55:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:57,265 INFO L475 AbstractCegarLoop]: Abstraction has 48036 states and 58924 transitions. [2019-09-08 06:55:57,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 48036 states and 58924 transitions. [2019-09-08 06:55:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:55:57,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:57,271 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:57,271 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1464201853, now seen corresponding path program 1 times [2019-09-08 06:55:57,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:57,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:57,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:55:57,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:57,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:57,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:57,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:57,380 INFO L87 Difference]: Start difference. First operand 48036 states and 58924 transitions. Second operand 5 states. [2019-09-08 06:56:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:03,193 INFO L93 Difference]: Finished difference Result 107869 states and 140818 transitions. [2019-09-08 06:56:03,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:03,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:56:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:03,361 INFO L225 Difference]: With dead ends: 107869 [2019-09-08 06:56:03,361 INFO L226 Difference]: Without dead ends: 59861 [2019-09-08 06:56:03,453 INFO L628 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-09-08 06:56:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59861 states. [2019-09-08 06:56:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59861 to 52868. [2019-09-08 06:56:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52868 states. [2019-09-08 06:56:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52868 states to 52868 states and 63852 transitions. [2019-09-08 06:56:09,374 INFO L78 Accepts]: Start accepts. Automaton has 52868 states and 63852 transitions. Word has length 205 [2019-09-08 06:56:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:09,375 INFO L475 AbstractCegarLoop]: Abstraction has 52868 states and 63852 transitions. [2019-09-08 06:56:09,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 52868 states and 63852 transitions. [2019-09-08 06:56:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:56:09,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:09,382 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:56:09,382 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:09,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:09,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2024901631, now seen corresponding path program 1 times [2019-09-08 06:56:09,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:09,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:09,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:09,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:09,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:56:09,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:09,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:09,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:09,483 INFO L87 Difference]: Start difference. First operand 52868 states and 63852 transitions. Second operand 5 states. [2019-09-08 06:56:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:16,180 INFO L93 Difference]: Finished difference Result 125591 states and 159107 transitions. [2019-09-08 06:56:16,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:56:16,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:56:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:16,375 INFO L225 Difference]: With dead ends: 125591 [2019-09-08 06:56:16,375 INFO L226 Difference]: Without dead ends: 72753 [2019-09-08 06:56:16,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:56:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72753 states. [2019-09-08 06:56:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72753 to 68024. [2019-09-08 06:56:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68024 states. [2019-09-08 06:56:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68024 states to 68024 states and 81154 transitions. [2019-09-08 06:56:24,277 INFO L78 Accepts]: Start accepts. Automaton has 68024 states and 81154 transitions. Word has length 205 [2019-09-08 06:56:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:24,277 INFO L475 AbstractCegarLoop]: Abstraction has 68024 states and 81154 transitions. [2019-09-08 06:56:24,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 68024 states and 81154 transitions. [2019-09-08 06:56:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:56:24,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:24,283 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:56:24,283 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:24,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:24,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1836336579, now seen corresponding path program 1 times [2019-09-08 06:56:24,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:24,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:24,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:24,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:24,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:56:24,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:24,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:24,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:24,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:24,380 INFO L87 Difference]: Start difference. First operand 68024 states and 81154 transitions. Second operand 5 states. [2019-09-08 06:56:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:31,123 INFO L93 Difference]: Finished difference Result 140191 states and 172846 transitions. [2019-09-08 06:56:31,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:31,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:56:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:31,347 INFO L225 Difference]: With dead ends: 140191 [2019-09-08 06:56:31,347 INFO L226 Difference]: Without dead ends: 72201 [2019-09-08 06:56:31,450 INFO L628 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-09-08 06:56:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72201 states. [2019-09-08 06:56:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72201 to 69840. [2019-09-08 06:56:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69840 states. [2019-09-08 06:56:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69840 states to 69840 states and 82418 transitions. [2019-09-08 06:56:37,193 INFO L78 Accepts]: Start accepts. Automaton has 69840 states and 82418 transitions. Word has length 205 [2019-09-08 06:56:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:37,193 INFO L475 AbstractCegarLoop]: Abstraction has 69840 states and 82418 transitions. [2019-09-08 06:56:37,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69840 states and 82418 transitions. [2019-09-08 06:56:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:56:37,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:37,199 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:56:37,199 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash -575419329, now seen corresponding path program 1 times [2019-09-08 06:56:37,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:37,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:37,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:37,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:37,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:56:37,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:37,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:37,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:37,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:37,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:37,639 INFO L87 Difference]: Start difference. First operand 69840 states and 82418 transitions. Second operand 5 states. [2019-09-08 06:56:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:46,125 INFO L93 Difference]: Finished difference Result 145095 states and 176792 transitions. [2019-09-08 06:56:46,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:46,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-09-08 06:56:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:46,370 INFO L225 Difference]: With dead ends: 145095 [2019-09-08 06:56:46,371 INFO L226 Difference]: Without dead ends: 75289 [2019-09-08 06:56:46,484 INFO L628 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-09-08 06:56:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75289 states. [2019-09-08 06:56:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75289 to 72924. [2019-09-08 06:56:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72924 states. [2019-09-08 06:56:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72924 states to 72924 states and 85150 transitions. [2019-09-08 06:56:52,810 INFO L78 Accepts]: Start accepts. Automaton has 72924 states and 85150 transitions. Word has length 205 [2019-09-08 06:56:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:52,811 INFO L475 AbstractCegarLoop]: Abstraction has 72924 states and 85150 transitions. [2019-09-08 06:56:52,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 72924 states and 85150 transitions. [2019-09-08 06:56:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 06:56:52,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:52,819 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:56:52,819 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:52,820 INFO L82 PathProgramCache]: Analyzing trace with hash -534744579, now seen corresponding path program 1 times [2019-09-08 06:56:52,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:52,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:52,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:56:52,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:56:52,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:56:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:56:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:53,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:56:53,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:56:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:56:53,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:56:53,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-08 06:56:53,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:56:53,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:56:53,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:56:53,196 INFO L87 Difference]: Start difference. First operand 72924 states and 85150 transitions. Second operand 3 states. [2019-09-08 06:57:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:05,987 INFO L93 Difference]: Finished difference Result 217251 states and 258364 transitions. [2019-09-08 06:57:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:57:05,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 06:57:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:06,647 INFO L225 Difference]: With dead ends: 217251 [2019-09-08 06:57:06,647 INFO L226 Difference]: Without dead ends: 144361 [2019-09-08 06:57:06,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:57:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144361 states. [2019-09-08 06:57:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144361 to 141779. [2019-09-08 06:57:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141779 states. [2019-09-08 06:57:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141779 states to 141779 states and 168515 transitions. [2019-09-08 06:57:22,495 INFO L78 Accepts]: Start accepts. Automaton has 141779 states and 168515 transitions. Word has length 205 [2019-09-08 06:57:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:22,496 INFO L475 AbstractCegarLoop]: Abstraction has 141779 states and 168515 transitions. [2019-09-08 06:57:22,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:57:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 141779 states and 168515 transitions. [2019-09-08 06:57:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 06:57:22,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:22,506 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:57:22,506 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:22,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash 985715263, now seen corresponding path program 1 times [2019-09-08 06:57:22,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:22,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:22,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:22,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:57:22,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:22,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:57:22,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:57:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:57:22,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:57:22,578 INFO L87 Difference]: Start difference. First operand 141779 states and 168515 transitions. Second operand 4 states. [2019-09-08 06:57:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:32,473 INFO L93 Difference]: Finished difference Result 251067 states and 297645 transitions. [2019-09-08 06:57:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:57:32,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-09-08 06:57:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:32,740 INFO L225 Difference]: With dead ends: 251067 [2019-09-08 06:57:32,740 INFO L226 Difference]: Without dead ends: 109318 [2019-09-08 06:57:32,912 INFO L628 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-09-08 06:57:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109318 states. [2019-09-08 06:57:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109318 to 108166. [2019-09-08 06:57:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108166 states. [2019-09-08 06:57:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108166 states to 108166 states and 127896 transitions. [2019-09-08 06:57:45,020 INFO L78 Accepts]: Start accepts. Automaton has 108166 states and 127896 transitions. Word has length 207 [2019-09-08 06:57:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:45,021 INFO L475 AbstractCegarLoop]: Abstraction has 108166 states and 127896 transitions. [2019-09-08 06:57:45,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:57:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 108166 states and 127896 transitions. [2019-09-08 06:57:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 06:57:45,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:45,028 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:57:45,028 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1847951099, now seen corresponding path program 1 times [2019-09-08 06:57:45,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:45,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:45,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:45,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:45,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:57:45,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:45,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:57:45,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:57:45,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:57:45,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:57:45,104 INFO L87 Difference]: Start difference. First operand 108166 states and 127896 transitions. Second operand 3 states. [2019-09-08 06:58:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:06,400 INFO L93 Difference]: Finished difference Result 323907 states and 391673 transitions. [2019-09-08 06:58:06,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:58:06,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-08 06:58:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:06,974 INFO L225 Difference]: With dead ends: 323907 [2019-09-08 06:58:06,974 INFO L226 Difference]: Without dead ends: 215775 [2019-09-08 06:58:07,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:58:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215775 states. [2019-09-08 06:58:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215775 to 215775. [2019-09-08 06:58:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215775 states. [2019-09-08 06:58:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215775 states to 215775 states and 261216 transitions. [2019-09-08 06:58:30,462 INFO L78 Accepts]: Start accepts. Automaton has 215775 states and 261216 transitions. Word has length 207 [2019-09-08 06:58:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:30,462 INFO L475 AbstractCegarLoop]: Abstraction has 215775 states and 261216 transitions. [2019-09-08 06:58:30,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:58:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 215775 states and 261216 transitions. [2019-09-08 06:58:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 06:58:30,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:30,556 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:58:30,556 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 470484778, now seen corresponding path program 1 times [2019-09-08 06:58:30,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:30,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 06:58:31,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:31,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:58:31,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:58:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:58:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:58:31,139 INFO L87 Difference]: Start difference. First operand 215775 states and 261216 transitions. Second operand 4 states. [2019-09-08 06:58:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:51,060 INFO L93 Difference]: Finished difference Result 377913 states and 455720 transitions. [2019-09-08 06:58:51,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:58:51,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-09-08 06:58:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:51,784 INFO L225 Difference]: With dead ends: 377913 [2019-09-08 06:58:51,785 INFO L226 Difference]: Without dead ends: 162168 [2019-09-08 06:58:52,044 INFO L628 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-09-08 06:58:52,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162168 states. [2019-09-08 06:59:05,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162168 to 162168. [2019-09-08 06:59:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162168 states. [2019-09-08 06:59:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162168 states to 162168 states and 194549 transitions. [2019-09-08 06:59:06,307 INFO L78 Accepts]: Start accepts. Automaton has 162168 states and 194549 transitions. Word has length 403 [2019-09-08 06:59:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:06,307 INFO L475 AbstractCegarLoop]: Abstraction has 162168 states and 194549 transitions. [2019-09-08 06:59:06,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:59:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 162168 states and 194549 transitions. [2019-09-08 06:59:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 06:59:06,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:06,358 INFO L399 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, 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-09-08 06:59:06,358 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:06,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1147305992, now seen corresponding path program 1 times [2019-09-08 06:59:06,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:06,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:06,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:06,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:06,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 06:59:06,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:59:06,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:59:06,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:59:06,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:59:06,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:59:06,471 INFO L87 Difference]: Start difference. First operand 162168 states and 194549 transitions. Second operand 6 states. [2019-09-08 06:59:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:23,470 INFO L93 Difference]: Finished difference Result 298564 states and 363913 transitions. [2019-09-08 06:59:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:59:23,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 305 [2019-09-08 06:59:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:23,856 INFO L225 Difference]: With dead ends: 298564 [2019-09-08 06:59:23,856 INFO L226 Difference]: Without dead ends: 136426 [2019-09-08 06:59:24,136 INFO L628 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-09-08 06:59:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136426 states. [2019-09-08 06:59:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136426 to 136426. [2019-09-08 06:59:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136426 states. [2019-09-08 06:59:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136426 states to 136426 states and 160740 transitions. [2019-09-08 06:59:36,192 INFO L78 Accepts]: Start accepts. Automaton has 136426 states and 160740 transitions. Word has length 305 [2019-09-08 06:59:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:36,193 INFO L475 AbstractCegarLoop]: Abstraction has 136426 states and 160740 transitions. [2019-09-08 06:59:36,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:59:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 136426 states and 160740 transitions. [2019-09-08 06:59:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 06:59:36,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:36,263 INFO L399 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, 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] [2019-09-08 06:59:36,263 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:36,264 INFO L82 PathProgramCache]: Analyzing trace with hash 791632313, now seen corresponding path program 1 times [2019-09-08 06:59:36,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:36,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:36,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-08 06:59:36,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:59:36,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:59:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:59:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:36,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1710 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:59:36,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:59:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:59:36,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:59:36,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-08 06:59:36,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:59:36,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:59:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:59:36,677 INFO L87 Difference]: Start difference. First operand 136426 states and 160740 transitions. Second operand 3 states. [2019-09-08 07:00:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:00:02,352 INFO L93 Difference]: Finished difference Result 348294 states and 415403 transitions. [2019-09-08 07:00:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:00:02,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-08 07:00:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:00:03,346 INFO L225 Difference]: With dead ends: 348294 [2019-09-08 07:00:03,347 INFO L226 Difference]: Without dead ends: 160814 [2019-09-08 07:00:04,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:00:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160814 states. [2019-09-08 07:00:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160814 to 160802. [2019-09-08 07:00:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160802 states. [2019-09-08 07:00:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160802 states to 160802 states and 190887 transitions. [2019-09-08 07:00:21,280 INFO L78 Accepts]: Start accepts. Automaton has 160802 states and 190887 transitions. Word has length 313 [2019-09-08 07:00:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:21,281 INFO L475 AbstractCegarLoop]: Abstraction has 160802 states and 190887 transitions. [2019-09-08 07:00:21,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:00:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 160802 states and 190887 transitions. [2019-09-08 07:00:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-08 07:00:21,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:21,626 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:00:21,626 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:21,626 INFO L82 PathProgramCache]: Analyzing trace with hash 158770813, now seen corresponding path program 1 times [2019-09-08 07:00:21,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:21,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:21,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-09-08 07:00:22,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:00:22,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:00:22,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:22,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 2090 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 07:00:22,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:00:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 07:00:22,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:00:22,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 07:00:22,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:00:22,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:00:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:00:22,925 INFO L87 Difference]: Start difference. First operand 160802 states and 190887 transitions. Second operand 6 states. [2019-09-08 07:01:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:11,590 INFO L93 Difference]: Finished difference Result 656794 states and 856460 transitions. [2019-09-08 07:01:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:01:11,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 421 [2019-09-08 07:01:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:13,565 INFO L225 Difference]: With dead ends: 656794 [2019-09-08 07:01:13,566 INFO L226 Difference]: Without dead ends: 496026 [2019-09-08 07:01:14,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:01:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496026 states. [2019-09-08 07:02:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496026 to 494055. [2019-09-08 07:02:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494055 states. [2019-09-08 07:02:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494055 states to 494055 states and 648772 transitions. [2019-09-08 07:02:22,127 INFO L78 Accepts]: Start accepts. Automaton has 494055 states and 648772 transitions. Word has length 421 [2019-09-08 07:02:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:22,127 INFO L475 AbstractCegarLoop]: Abstraction has 494055 states and 648772 transitions. [2019-09-08 07:02:22,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:02:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 494055 states and 648772 transitions. [2019-09-08 07:02:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2019-09-08 07:02:23,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:23,744 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:23,744 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1450933693, now seen corresponding path program 1 times [2019-09-08 07:02:23,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:23,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:23,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2019-09-08 07:02:25,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:02:25,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:02:25,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:02:25,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:02:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:02:25,394 INFO L87 Difference]: Start difference. First operand 494055 states and 648772 transitions. Second operand 4 states. [2019-09-08 07:03:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:03:20,046 INFO L93 Difference]: Finished difference Result 939487 states and 1233846 transitions. [2019-09-08 07:03:20,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:03:20,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 619 [2019-09-08 07:03:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:03:21,909 INFO L225 Difference]: With dead ends: 939487 [2019-09-08 07:03:21,909 INFO L226 Difference]: Without dead ends: 445462 [2019-09-08 07:03:23,125 INFO L628 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-09-08 07:03:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445462 states. [2019-09-08 07:04:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445462 to 443206. [2019-09-08 07:04:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443206 states. [2019-09-08 07:04:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443206 states to 443206 states and 579459 transitions. [2019-09-08 07:04:24,742 INFO L78 Accepts]: Start accepts. Automaton has 443206 states and 579459 transitions. Word has length 619 [2019-09-08 07:04:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:04:24,742 INFO L475 AbstractCegarLoop]: Abstraction has 443206 states and 579459 transitions. [2019-09-08 07:04:24,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:04:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 443206 states and 579459 transitions. [2019-09-08 07:04:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2019-09-08 07:04:26,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:04:26,022 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:04:26,022 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:04:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:04:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 789015319, now seen corresponding path program 1 times [2019-09-08 07:04:26,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:04:26,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:04:26,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:26,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:04:26,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 54 proven. 5 refuted. 0 times theorem prover too weak. 1423 trivial. 0 not checked. [2019-09-08 07:04:26,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:04:26,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:04:26,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:04:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:26,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 3333 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:04:26,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:04:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-09-08 07:04:27,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:04:27,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 07:04:27,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:04:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:04:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:04:27,822 INFO L87 Difference]: Start difference. First operand 443206 states and 579459 transitions. Second operand 5 states.