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/token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:23,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:23,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:23,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:23,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:23,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:23,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:23,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:23,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:23,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:23,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:23,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:23,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:23,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:23,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:23,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:23,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:23,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:23,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:23,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:23,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:23,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:23,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:23,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:23,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:23,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:23,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:23,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:23,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:23,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:23,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:23,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:23,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:23,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:23,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:23,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:23,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:23,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:23,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:23,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:23,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:23,251 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-10-14 23:50:23,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:23,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:23,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:23,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:23,283 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:23,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:23,284 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:23,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:23,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:23,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:23,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:23,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:23,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:23,285 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:23,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:23,286 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:23,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:23,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:23,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:23,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:23,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:23,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:23,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:23,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:23,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:23,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:23,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:23,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:23,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:23,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:23,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:23,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:23,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:23,580 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:23,581 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-10-14 23:50:23,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/496240b63/c3c9f7be5fc542d9be2726dd5d136713/FLAG6e1de0e34 [2019-10-14 23:50:24,172 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:24,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-10-14 23:50:24,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/496240b63/c3c9f7be5fc542d9be2726dd5d136713/FLAG6e1de0e34 [2019-10-14 23:50:24,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/496240b63/c3c9f7be5fc542d9be2726dd5d136713 [2019-10-14 23:50:24,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:24,525 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:24,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:24,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:24,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:24,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369e13a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24, skipping insertion in model container [2019-10-14 23:50:24,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,542 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:24,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:24,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:24,893 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:25,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:25,062 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:25,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25 WrapperNode [2019-10-14 23:50:25,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:25,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:25,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:25,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:25,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (1/1) ... [2019-10-14 23:50:25,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (1/1) ... [2019-10-14 23:50:25,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (1/1) ... [2019-10-14 23:50:25,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (1/1) ... [2019-10-14 23:50:25,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (1/1) ... [2019-10-14 23:50:25,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (1/1) ... [2019-10-14 23:50:25,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (1/1) ... [2019-10-14 23:50:25,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:25,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:25,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:25,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:25,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:25,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:25,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:25,178 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-14 23:50:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-14 23:50:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-14 23:50:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-14 23:50:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-14 23:50:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-14 23:50:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-14 23:50:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-14 23:50:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:50:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:50:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:50:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:50:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:50:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:50:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:50:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:50:25,182 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:50:25,182 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:50:25,182 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:50:25,183 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:25,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:25,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:25,183 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:25,183 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-14 23:50:25,183 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-14 23:50:25,184 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-14 23:50:25,184 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-14 23:50:25,184 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:50:25,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:25,184 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-14 23:50:25,184 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-14 23:50:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-14 23:50:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-14 23:50:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:50:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:50:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:50:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:50:25,186 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:50:25,186 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:50:25,186 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:50:25,186 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:50:25,186 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:50:25,186 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:50:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:25,886 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:25,887 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:50:25,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:25 BoogieIcfgContainer [2019-10-14 23:50:25,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:25,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:25,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:25,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:25,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:24" (1/3) ... [2019-10-14 23:50:25,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38918ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:25, skipping insertion in model container [2019-10-14 23:50:25,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:25" (2/3) ... [2019-10-14 23:50:25,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38918ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:25, skipping insertion in model container [2019-10-14 23:50:25,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:25" (3/3) ... [2019-10-14 23:50:25,898 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2019-10-14 23:50:25,909 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:25,918 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:25,930 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:25,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:25,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:25,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:25,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:25,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:25,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:25,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:25,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states. [2019-10-14 23:50:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:26,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:26,008 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:26,010 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1386466573, now seen corresponding path program 1 times [2019-10-14 23:50:26,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:26,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877236355] [2019-10-14 23:50:26,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:26,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:26,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:26,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877236355] [2019-10-14 23:50:26,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:26,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:26,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160747181] [2019-10-14 23:50:26,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:26,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:26,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:26,801 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 9 states. [2019-10-14 23:50:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:30,412 INFO L93 Difference]: Finished difference Result 757 states and 1195 transitions. [2019-10-14 23:50:30,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:30,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-10-14 23:50:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:30,436 INFO L225 Difference]: With dead ends: 757 [2019-10-14 23:50:30,437 INFO L226 Difference]: Without dead ends: 555 [2019-10-14 23:50:30,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-14 23:50:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 366. [2019-10-14 23:50:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-14 23:50:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 511 transitions. [2019-10-14 23:50:30,583 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 511 transitions. Word has length 105 [2019-10-14 23:50:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:30,586 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 511 transitions. [2019-10-14 23:50:30,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 511 transitions. [2019-10-14 23:50:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:30,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:30,598 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:30,598 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash 881891251, now seen corresponding path program 1 times [2019-10-14 23:50:30,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:30,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142730298] [2019-10-14 23:50:30,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:30,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:30,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:30,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142730298] [2019-10-14 23:50:30,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:30,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:30,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519339558] [2019-10-14 23:50:30,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:30,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:30,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:30,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:30,924 INFO L87 Difference]: Start difference. First operand 366 states and 511 transitions. Second operand 10 states. [2019-10-14 23:50:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:32,923 INFO L93 Difference]: Finished difference Result 891 states and 1302 transitions. [2019-10-14 23:50:32,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:32,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:32,930 INFO L225 Difference]: With dead ends: 891 [2019-10-14 23:50:32,930 INFO L226 Difference]: Without dead ends: 546 [2019-10-14 23:50:32,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-14 23:50:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 366. [2019-10-14 23:50:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-14 23:50:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 504 transitions. [2019-10-14 23:50:32,991 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 504 transitions. Word has length 105 [2019-10-14 23:50:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:32,993 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 504 transitions. [2019-10-14 23:50:32,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 504 transitions. [2019-10-14 23:50:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:32,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:32,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:32,998 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash -153314573, now seen corresponding path program 1 times [2019-10-14 23:50:32,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:32,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028985040] [2019-10-14 23:50:32,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:32,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:32,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:33,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028985040] [2019-10-14 23:50:33,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:33,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:33,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126061446] [2019-10-14 23:50:33,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:33,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:33,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:33,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:33,269 INFO L87 Difference]: Start difference. First operand 366 states and 504 transitions. Second operand 10 states. [2019-10-14 23:50:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:34,996 INFO L93 Difference]: Finished difference Result 887 states and 1280 transitions. [2019-10-14 23:50:34,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:34,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:35,001 INFO L225 Difference]: With dead ends: 887 [2019-10-14 23:50:35,002 INFO L226 Difference]: Without dead ends: 542 [2019-10-14 23:50:35,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-14 23:50:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2019-10-14 23:50:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-14 23:50:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 497 transitions. [2019-10-14 23:50:35,053 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 497 transitions. Word has length 105 [2019-10-14 23:50:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:35,053 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 497 transitions. [2019-10-14 23:50:35,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 497 transitions. [2019-10-14 23:50:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:35,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:35,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:35,056 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:35,056 INFO L82 PathProgramCache]: Analyzing trace with hash 90386355, now seen corresponding path program 1 times [2019-10-14 23:50:35,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:35,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260796437] [2019-10-14 23:50:35,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:35,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:35,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:35,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260796437] [2019-10-14 23:50:35,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:35,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:35,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949071138] [2019-10-14 23:50:35,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:35,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:35,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:35,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:35,296 INFO L87 Difference]: Start difference. First operand 366 states and 497 transitions. Second operand 10 states. [2019-10-14 23:50:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:37,821 INFO L93 Difference]: Finished difference Result 1074 states and 1604 transitions. [2019-10-14 23:50:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:37,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:37,835 INFO L225 Difference]: With dead ends: 1074 [2019-10-14 23:50:37,836 INFO L226 Difference]: Without dead ends: 729 [2019-10-14 23:50:37,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-10-14 23:50:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 458. [2019-10-14 23:50:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-14 23:50:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 602 transitions. [2019-10-14 23:50:37,936 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 602 transitions. Word has length 105 [2019-10-14 23:50:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:37,936 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 602 transitions. [2019-10-14 23:50:37,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 602 transitions. [2019-10-14 23:50:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:37,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:37,939 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:37,940 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1442319245, now seen corresponding path program 1 times [2019-10-14 23:50:37,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:37,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222777109] [2019-10-14 23:50:37,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:37,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:37,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:38,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222777109] [2019-10-14 23:50:38,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:38,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:38,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213834197] [2019-10-14 23:50:38,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:38,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:38,243 INFO L87 Difference]: Start difference. First operand 458 states and 602 transitions. Second operand 10 states. [2019-10-14 23:50:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:40,745 INFO L93 Difference]: Finished difference Result 1284 states and 1852 transitions. [2019-10-14 23:50:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:40,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:40,752 INFO L225 Difference]: With dead ends: 1284 [2019-10-14 23:50:40,752 INFO L226 Difference]: Without dead ends: 847 [2019-10-14 23:50:40,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:50:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-10-14 23:50:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 550. [2019-10-14 23:50:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-14 23:50:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 703 transitions. [2019-10-14 23:50:40,823 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 703 transitions. Word has length 105 [2019-10-14 23:50:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:40,824 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 703 transitions. [2019-10-14 23:50:40,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 703 transitions. [2019-10-14 23:50:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:40,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:40,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:40,826 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:40,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1353214029, now seen corresponding path program 1 times [2019-10-14 23:50:40,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:40,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674027167] [2019-10-14 23:50:40,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:41,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674027167] [2019-10-14 23:50:41,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:41,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:41,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959206085] [2019-10-14 23:50:41,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:41,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:41,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:41,044 INFO L87 Difference]: Start difference. First operand 550 states and 703 transitions. Second operand 10 states. [2019-10-14 23:50:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:43,493 INFO L93 Difference]: Finished difference Result 1494 states and 2090 transitions. [2019-10-14 23:50:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:43,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:43,503 INFO L225 Difference]: With dead ends: 1494 [2019-10-14 23:50:43,504 INFO L226 Difference]: Without dead ends: 965 [2019-10-14 23:50:43,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-10-14 23:50:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 642. [2019-10-14 23:50:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-14 23:50:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 800 transitions. [2019-10-14 23:50:43,572 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 800 transitions. Word has length 105 [2019-10-14 23:50:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:43,572 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 800 transitions. [2019-10-14 23:50:43,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 800 transitions. [2019-10-14 23:50:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:43,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:43,574 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:43,574 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:43,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:43,574 INFO L82 PathProgramCache]: Analyzing trace with hash 864416369, now seen corresponding path program 1 times [2019-10-14 23:50:43,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:43,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324277995] [2019-10-14 23:50:43,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:43,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:43,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:43,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324277995] [2019-10-14 23:50:43,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:43,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:43,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312415697] [2019-10-14 23:50:43,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:43,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:43,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:43,934 INFO L87 Difference]: Start difference. First operand 642 states and 800 transitions. Second operand 10 states. [2019-10-14 23:50:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:46,333 INFO L93 Difference]: Finished difference Result 1694 states and 2308 transitions. [2019-10-14 23:50:46,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:46,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:46,341 INFO L225 Difference]: With dead ends: 1694 [2019-10-14 23:50:46,341 INFO L226 Difference]: Without dead ends: 1073 [2019-10-14 23:50:46,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2019-10-14 23:50:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 728. [2019-10-14 23:50:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-14 23:50:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 887 transitions. [2019-10-14 23:50:46,419 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 887 transitions. Word has length 105 [2019-10-14 23:50:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:46,419 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 887 transitions. [2019-10-14 23:50:46,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 887 transitions. [2019-10-14 23:50:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:46,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:46,421 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:46,421 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1830459983, now seen corresponding path program 1 times [2019-10-14 23:50:46,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:46,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115865717] [2019-10-14 23:50:46,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:46,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:46,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:46,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115865717] [2019-10-14 23:50:46,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:46,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:46,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400377499] [2019-10-14 23:50:46,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:46,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:46,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:46,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:46,650 INFO L87 Difference]: Start difference. First operand 728 states and 887 transitions. Second operand 10 states. [2019-10-14 23:50:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:49,470 INFO L93 Difference]: Finished difference Result 1712 states and 2193 transitions. [2019-10-14 23:50:49,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:49,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:49,476 INFO L225 Difference]: With dead ends: 1712 [2019-10-14 23:50:49,476 INFO L226 Difference]: Without dead ends: 1006 [2019-10-14 23:50:49,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:50:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-10-14 23:50:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 738. [2019-10-14 23:50:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-14 23:50:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 889 transitions. [2019-10-14 23:50:49,556 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 889 transitions. Word has length 105 [2019-10-14 23:50:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:49,557 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 889 transitions. [2019-10-14 23:50:49,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 889 transitions. [2019-10-14 23:50:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:49,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:49,560 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:49,560 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1151187729, now seen corresponding path program 1 times [2019-10-14 23:50:49,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:49,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755155651] [2019-10-14 23:50:49,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:49,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:49,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:49,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755155651] [2019-10-14 23:50:49,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:49,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:49,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995547583] [2019-10-14 23:50:49,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:49,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:49,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:49,817 INFO L87 Difference]: Start difference. First operand 738 states and 889 transitions. Second operand 10 states. [2019-10-14 23:50:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:52,137 INFO L93 Difference]: Finished difference Result 1708 states and 2157 transitions. [2019-10-14 23:50:52,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:52,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:52,144 INFO L225 Difference]: With dead ends: 1708 [2019-10-14 23:50:52,145 INFO L226 Difference]: Without dead ends: 992 [2019-10-14 23:50:52,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-10-14 23:50:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 748. [2019-10-14 23:50:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-14 23:50:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 891 transitions. [2019-10-14 23:50:52,228 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 891 transitions. Word has length 105 [2019-10-14 23:50:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:52,228 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 891 transitions. [2019-10-14 23:50:52,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 891 transitions. [2019-10-14 23:50:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:52,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:52,230 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:52,231 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:52,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash -707287055, now seen corresponding path program 1 times [2019-10-14 23:50:52,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:52,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170363576] [2019-10-14 23:50:52,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:52,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170363576] [2019-10-14 23:50:52,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:52,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:52,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281910218] [2019-10-14 23:50:52,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:52,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:52,436 INFO L87 Difference]: Start difference. First operand 748 states and 891 transitions. Second operand 10 states. [2019-10-14 23:50:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:54,841 INFO L93 Difference]: Finished difference Result 1710 states and 2129 transitions. [2019-10-14 23:50:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:54,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:54,846 INFO L225 Difference]: With dead ends: 1710 [2019-10-14 23:50:54,846 INFO L226 Difference]: Without dead ends: 984 [2019-10-14 23:50:54,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-10-14 23:50:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 758. [2019-10-14 23:50:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-10-14 23:50:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 893 transitions. [2019-10-14 23:50:54,923 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 893 transitions. Word has length 105 [2019-10-14 23:50:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:54,924 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 893 transitions. [2019-10-14 23:50:54,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 893 transitions. [2019-10-14 23:50:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:54,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:54,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:54,926 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1538292399, now seen corresponding path program 1 times [2019-10-14 23:50:54,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:54,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372771148] [2019-10-14 23:50:54,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:54,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:54,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:55,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372771148] [2019-10-14 23:50:55,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:55,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:55,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850706488] [2019-10-14 23:50:55,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:55,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:55,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:55,214 INFO L87 Difference]: Start difference. First operand 758 states and 893 transitions. Second operand 10 states. [2019-10-14 23:50:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:57,325 INFO L93 Difference]: Finished difference Result 1722 states and 2117 transitions. [2019-10-14 23:50:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:57,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:57,330 INFO L225 Difference]: With dead ends: 1722 [2019-10-14 23:50:57,331 INFO L226 Difference]: Without dead ends: 986 [2019-10-14 23:50:57,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-10-14 23:50:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 768. [2019-10-14 23:50:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-10-14 23:50:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 895 transitions. [2019-10-14 23:50:57,406 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 895 transitions. Word has length 105 [2019-10-14 23:50:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:57,407 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 895 transitions. [2019-10-14 23:50:57,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 895 transitions. [2019-10-14 23:50:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:57,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:57,408 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:57,408 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash 694286897, now seen corresponding path program 1 times [2019-10-14 23:50:57,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:57,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123397523] [2019-10-14 23:50:57,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:57,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:57,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:57,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123397523] [2019-10-14 23:50:57,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:57,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:57,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021645247] [2019-10-14 23:50:57,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:57,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:57,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:57,632 INFO L87 Difference]: Start difference. First operand 768 states and 895 transitions. Second operand 10 states. [2019-10-14 23:50:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:59,175 INFO L93 Difference]: Finished difference Result 1707 states and 2041 transitions. [2019-10-14 23:50:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:59,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:59,181 INFO L225 Difference]: With dead ends: 1707 [2019-10-14 23:50:59,181 INFO L226 Difference]: Without dead ends: 960 [2019-10-14 23:50:59,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-10-14 23:50:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 768. [2019-10-14 23:50:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-10-14 23:50:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 886 transitions. [2019-10-14 23:50:59,259 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 886 transitions. Word has length 105 [2019-10-14 23:50:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:59,259 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 886 transitions. [2019-10-14 23:50:59,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 886 transitions. [2019-10-14 23:50:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:59,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:59,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:59,261 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 184813807, now seen corresponding path program 1 times [2019-10-14 23:50:59,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:59,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693891830] [2019-10-14 23:50:59,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:59,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:59,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:59,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693891830] [2019-10-14 23:50:59,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:59,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:59,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391989977] [2019-10-14 23:50:59,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:59,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:59,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:59,458 INFO L87 Difference]: Start difference. First operand 768 states and 886 transitions. Second operand 7 states.