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/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:53,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:53,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:53,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:53,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:53,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:53,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:53,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:53,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:53,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:53,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:53,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:53,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:53,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:53,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:53,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:53,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:53,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:53,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:53,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:53,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:53,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:53,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:53,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:53,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:53,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:53,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:53,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:53,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:53,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:53,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:53,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:53,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:53,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:53,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:53,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:53,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:53,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:53,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:53,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:53,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:53,193 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:49:53,207 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:53,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:53,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:53,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:53,209 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:53,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:53,210 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:53,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:53,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:53,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:53,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:53,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:53,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:53,211 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:53,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:53,211 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:53,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:53,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:53,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:53,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:53,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:53,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:53,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:53,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:53,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:53,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:53,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:53,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:53,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:53,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:53,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:53,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:53,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:53,526 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:53,526 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-14 23:49:53,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a07d226/e102db62a0ef4c9f96c5889c9175ee75/FLAG5f44ae0b5 [2019-10-14 23:49:54,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:54,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-14 23:49:54,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a07d226/e102db62a0ef4c9f96c5889c9175ee75/FLAG5f44ae0b5 [2019-10-14 23:49:54,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a07d226/e102db62a0ef4c9f96c5889c9175ee75 [2019-10-14 23:49:54,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:54,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:54,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:54,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:54,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:54,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:54" (1/1) ... [2019-10-14 23:49:54,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b073ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:54, skipping insertion in model container [2019-10-14 23:49:54,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:54" (1/1) ... [2019-10-14 23:49:54,552 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:54,610 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:54,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:54,904 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:55,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:55,084 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:55,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55 WrapperNode [2019-10-14 23:49:55,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:55,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:55,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:55,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:55,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (1/1) ... [2019-10-14 23:49:55,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (1/1) ... [2019-10-14 23:49:55,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (1/1) ... [2019-10-14 23:49:55,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (1/1) ... [2019-10-14 23:49:55,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (1/1) ... [2019-10-14 23:49:55,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (1/1) ... [2019-10-14 23:49:55,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (1/1) ... [2019-10-14 23:49:55,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:55,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:55,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:55,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:55,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (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:49:55,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:55,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:55,213 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:49:55,213 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-14 23:49:55,214 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-14 23:49:55,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-14 23:49:55,214 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-14 23:49:55,214 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-14 23:49:55,214 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-14 23:49:55,215 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:49:55,215 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:49:55,215 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:49:55,215 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:49:55,215 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:49:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:49:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:49:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:49:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:49:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:49:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:49:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:49:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:49:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:49:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:49:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-14 23:49:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-14 23:49:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-14 23:49:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-14 23:49:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-14 23:49:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-14 23:49:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:49:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:49:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:49:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:49:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:49:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:49:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:49:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:49:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:49:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:49:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:49:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:49:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:55,740 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:55,741 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-14 23:49:55,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:55 BoogieIcfgContainer [2019-10-14 23:49:55,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:55,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:55,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:55,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:55,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:54" (1/3) ... [2019-10-14 23:49:55,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bd4b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:55, skipping insertion in model container [2019-10-14 23:49:55,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:55" (2/3) ... [2019-10-14 23:49:55,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bd4b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:55, skipping insertion in model container [2019-10-14 23:49:55,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:55" (3/3) ... [2019-10-14 23:49:55,751 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2019-10-14 23:49:55,761 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:55,769 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:55,781 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:55,809 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:55,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:55,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:55,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:55,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:55,811 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:55,811 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:55,811 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-14 23:49:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-14 23:49:55,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,849 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] [2019-10-14 23:49:55,851 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash -798642762, now seen corresponding path program 1 times [2019-10-14 23:49:55,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250839122] [2019-10-14 23:49:55,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,443 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:49:56,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250839122] [2019-10-14 23:49:56,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:49:56,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700805708] [2019-10-14 23:49:56,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:49:56,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:49:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:49:56,474 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 7 states. [2019-10-14 23:49:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,408 INFO L93 Difference]: Finished difference Result 438 states and 619 transitions. [2019-10-14 23:49:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:49:58,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-10-14 23:49:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,439 INFO L225 Difference]: With dead ends: 438 [2019-10-14 23:49:58,440 INFO L226 Difference]: Without dead ends: 294 [2019-10-14 23:49:58,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:49:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-14 23:49:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 256. [2019-10-14 23:49:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-14 23:49:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 331 transitions. [2019-10-14 23:49:58,551 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 331 transitions. Word has length 72 [2019-10-14 23:49:58,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,552 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 331 transitions. [2019-10-14 23:49:58,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:49:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2019-10-14 23:49:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-14 23:49:58,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,557 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] [2019-10-14 23:49:58,557 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1672120457, now seen corresponding path program 1 times [2019-10-14 23:49:58,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849889553] [2019-10-14 23:49:58,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,855 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:49:58,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849889553] [2019-10-14 23:49:58,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:49:58,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229347813] [2019-10-14 23:49:58,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:49:58,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:49:58,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:49:58,860 INFO L87 Difference]: Start difference. First operand 256 states and 331 transitions. Second operand 7 states. [2019-10-14 23:50:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,297 INFO L93 Difference]: Finished difference Result 767 states and 1035 transitions. [2019-10-14 23:50:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:00,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-10-14 23:50:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,304 INFO L225 Difference]: With dead ends: 767 [2019-10-14 23:50:00,305 INFO L226 Difference]: Without dead ends: 531 [2019-10-14 23:50:00,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-14 23:50:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 474. [2019-10-14 23:50:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-14 23:50:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 611 transitions. [2019-10-14 23:50:00,383 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 611 transitions. Word has length 72 [2019-10-14 23:50:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,383 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 611 transitions. [2019-10-14 23:50:00,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 611 transitions. [2019-10-14 23:50:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-14 23:50:00,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,386 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] [2019-10-14 23:50:00,386 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,387 INFO L82 PathProgramCache]: Analyzing trace with hash -539585734, now seen corresponding path program 1 times [2019-10-14 23:50:00,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675695240] [2019-10-14 23:50:00,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,616 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:00,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675695240] [2019-10-14 23:50:00,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:00,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502190028] [2019-10-14 23:50:00,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:00,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:00,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:00,620 INFO L87 Difference]: Start difference. First operand 474 states and 611 transitions. Second operand 7 states. [2019-10-14 23:50:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,092 INFO L93 Difference]: Finished difference Result 1217 states and 1631 transitions. [2019-10-14 23:50:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:02,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-10-14 23:50:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,100 INFO L225 Difference]: With dead ends: 1217 [2019-10-14 23:50:02,100 INFO L226 Difference]: Without dead ends: 763 [2019-10-14 23:50:02,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-10-14 23:50:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 678. [2019-10-14 23:50:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-14 23:50:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 869 transitions. [2019-10-14 23:50:02,229 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 869 transitions. Word has length 73 [2019-10-14 23:50:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,231 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 869 transitions. [2019-10-14 23:50:02,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 869 transitions. [2019-10-14 23:50:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-14 23:50:02,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,240 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] [2019-10-14 23:50:02,240 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1990564953, now seen corresponding path program 1 times [2019-10-14 23:50:02,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365217913] [2019-10-14 23:50:02,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,467 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:02,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365217913] [2019-10-14 23:50:02,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:02,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:02,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955770739] [2019-10-14 23:50:02,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:02,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:02,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:02,471 INFO L87 Difference]: Start difference. First operand 678 states and 869 transitions. Second operand 9 states. [2019-10-14 23:50:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,754 INFO L93 Difference]: Finished difference Result 1406 states and 1827 transitions. [2019-10-14 23:50:03,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:03,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-10-14 23:50:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,761 INFO L225 Difference]: With dead ends: 1406 [2019-10-14 23:50:03,762 INFO L226 Difference]: Without dead ends: 748 [2019-10-14 23:50:03,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-14 23:50:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 693. [2019-10-14 23:50:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-10-14 23:50:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 881 transitions. [2019-10-14 23:50:03,842 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 881 transitions. Word has length 73 [2019-10-14 23:50:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,842 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 881 transitions. [2019-10-14 23:50:03,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 881 transitions. [2019-10-14 23:50:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-14 23:50:03,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:03,844 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] [2019-10-14 23:50:03,844 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash 618757655, now seen corresponding path program 1 times [2019-10-14 23:50:03,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883592948] [2019-10-14 23:50:03,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,011 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:04,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883592948] [2019-10-14 23:50:04,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:04,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684932964] [2019-10-14 23:50:04,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:04,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:04,014 INFO L87 Difference]: Start difference. First operand 693 states and 881 transitions. Second operand 9 states. [2019-10-14 23:50:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,184 INFO L93 Difference]: Finished difference Result 1441 states and 1858 transitions. [2019-10-14 23:50:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:05,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-10-14 23:50:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,192 INFO L225 Difference]: With dead ends: 1441 [2019-10-14 23:50:05,193 INFO L226 Difference]: Without dead ends: 768 [2019-10-14 23:50:05,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:50:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-10-14 23:50:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 713. [2019-10-14 23:50:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-10-14 23:50:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 899 transitions. [2019-10-14 23:50:05,269 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 899 transitions. Word has length 73 [2019-10-14 23:50:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,269 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 899 transitions. [2019-10-14 23:50:05,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 899 transitions. [2019-10-14 23:50:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-14 23:50:05,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,271 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] [2019-10-14 23:50:05,271 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash 641389909, now seen corresponding path program 1 times [2019-10-14 23:50:05,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25382014] [2019-10-14 23:50:05,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,478 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:05,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25382014] [2019-10-14 23:50:05,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:05,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:05,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521075508] [2019-10-14 23:50:05,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:05,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:05,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:05,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:05,481 INFO L87 Difference]: Start difference. First operand 713 states and 899 transitions. Second operand 9 states. [2019-10-14 23:50:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:07,102 INFO L93 Difference]: Finished difference Result 1504 states and 1933 transitions. [2019-10-14 23:50:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:50:07,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-10-14 23:50:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:07,113 INFO L225 Difference]: With dead ends: 1504 [2019-10-14 23:50:07,114 INFO L226 Difference]: Without dead ends: 905 [2019-10-14 23:50:07,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-10-14 23:50:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 830. [2019-10-14 23:50:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-10-14 23:50:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1049 transitions. [2019-10-14 23:50:07,192 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1049 transitions. Word has length 73 [2019-10-14 23:50:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:07,193 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1049 transitions. [2019-10-14 23:50:07,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1049 transitions. [2019-10-14 23:50:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-14 23:50:07,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:07,195 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] [2019-10-14 23:50:07,195 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash 298865229, now seen corresponding path program 1 times [2019-10-14 23:50:07,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:07,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236271069] [2019-10-14 23:50:07,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,459 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:07,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236271069] [2019-10-14 23:50:07,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:07,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:50:07,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176032491] [2019-10-14 23:50:07,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:50:07,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:50:07,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:50:07,472 INFO L87 Difference]: Start difference. First operand 830 states and 1049 transitions. Second operand 12 states. [2019-10-14 23:50:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:10,912 INFO L93 Difference]: Finished difference Result 1688 states and 2262 transitions. [2019-10-14 23:50:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-14 23:50:10,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-10-14 23:50:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:10,923 INFO L225 Difference]: With dead ends: 1688 [2019-10-14 23:50:10,924 INFO L226 Difference]: Without dead ends: 1198 [2019-10-14 23:50:10,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=450, Invalid=1442, Unknown=0, NotChecked=0, Total=1892 [2019-10-14 23:50:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-10-14 23:50:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1031. [2019-10-14 23:50:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-10-14 23:50:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1353 transitions. [2019-10-14 23:50:11,020 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1353 transitions. Word has length 86 [2019-10-14 23:50:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:11,021 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1353 transitions. [2019-10-14 23:50:11,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:50:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1353 transitions. [2019-10-14 23:50:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:50:11,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:11,023 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] [2019-10-14 23:50:11,023 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:11,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -681624608, now seen corresponding path program 1 times [2019-10-14 23:50:11,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:11,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758740207] [2019-10-14 23:50:11,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,358 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:11,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758740207] [2019-10-14 23:50:11,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:11,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-14 23:50:11,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345949065] [2019-10-14 23:50:11,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:50:11,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:11,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:50:11,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:11,361 INFO L87 Difference]: Start difference. First operand 1031 states and 1353 transitions. Second operand 14 states. [2019-10-14 23:50:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:15,424 INFO L93 Difference]: Finished difference Result 2366 states and 3267 transitions. [2019-10-14 23:50:15,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-14 23:50:15,424 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2019-10-14 23:50:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:15,436 INFO L225 Difference]: With dead ends: 2366 [2019-10-14 23:50:15,436 INFO L226 Difference]: Without dead ends: 1825 [2019-10-14 23:50:15,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=453, Invalid=1709, Unknown=0, NotChecked=0, Total=2162 [2019-10-14 23:50:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-10-14 23:50:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1529. [2019-10-14 23:50:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1529 states. [2019-10-14 23:50:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2046 transitions. [2019-10-14 23:50:15,558 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2046 transitions. Word has length 90 [2019-10-14 23:50:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:15,558 INFO L462 AbstractCegarLoop]: Abstraction has 1529 states and 2046 transitions. [2019-10-14 23:50:15,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:50:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2046 transitions. [2019-10-14 23:50:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:15,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:15,560 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:15,561 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:15,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1835313196, now seen corresponding path program 1 times [2019-10-14 23:50:15,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:15,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191181844] [2019-10-14 23:50:15,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:50:15,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191181844] [2019-10-14 23:50:15,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430998777] [2019-10-14 23:50:15,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:15,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:50:15,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:15,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2019-10-14 23:50:15,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203723456] [2019-10-14 23:50:15,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:15,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:15,898 INFO L87 Difference]: Start difference. First operand 1529 states and 2046 transitions. Second operand 3 states. [2019-10-14 23:50:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:16,073 INFO L93 Difference]: Finished difference Result 4357 states and 6479 transitions. [2019-10-14 23:50:16,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:16,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-14 23:50:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:16,093 INFO L225 Difference]: With dead ends: 4357 [2019-10-14 23:50:16,093 INFO L226 Difference]: Without dead ends: 2849 [2019-10-14 23:50:16,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2019-10-14 23:50:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2845. [2019-10-14 23:50:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-10-14 23:50:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4087 transitions. [2019-10-14 23:50:16,380 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4087 transitions. Word has length 92 [2019-10-14 23:50:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:16,381 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 4087 transitions. [2019-10-14 23:50:16,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4087 transitions. [2019-10-14 23:50:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-14 23:50:16,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:16,385 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:16,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:16,589 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:16,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:16,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1952555228, now seen corresponding path program 1 times [2019-10-14 23:50:16,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:16,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222032666] [2019-10-14 23:50:16,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:16,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:16,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:50:16,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222032666] [2019-10-14 23:50:16,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219827406] [2019-10-14 23:50:16,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:16,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:16,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:16,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2019-10-14 23:50:16,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883156198] [2019-10-14 23:50:16,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:16,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:16,916 INFO L87 Difference]: Start difference. First operand 2845 states and 4087 transitions. Second operand 3 states. [2019-10-14 23:50:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:17,283 INFO L93 Difference]: Finished difference Result 8007 states and 12165 transitions. [2019-10-14 23:50:17,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:17,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-14 23:50:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:17,323 INFO L225 Difference]: With dead ends: 8007 [2019-10-14 23:50:17,323 INFO L226 Difference]: Without dead ends: 5189 [2019-10-14 23:50:17,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2019-10-14 23:50:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5147. [2019-10-14 23:50:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5147 states. [2019-10-14 23:50:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 6896 transitions. [2019-10-14 23:50:17,984 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 6896 transitions. Word has length 94 [2019-10-14 23:50:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:17,985 INFO L462 AbstractCegarLoop]: Abstraction has 5147 states and 6896 transitions. [2019-10-14 23:50:17,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 6896 transitions. [2019-10-14 23:50:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-14 23:50:17,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:17,990 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:18,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:18,196 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1028804159, now seen corresponding path program 1 times [2019-10-14 23:50:18,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:18,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240571648] [2019-10-14 23:50:18,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:18,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:18,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:50:18,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240571648] [2019-10-14 23:50:18,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518384817] [2019-10-14 23:50:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:18,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:18,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:18,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-10-14 23:50:18,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658447619] [2019-10-14 23:50:18,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:18,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:18,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:18,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:18,599 INFO L87 Difference]: Start difference. First operand 5147 states and 6896 transitions. Second operand 3 states. [2019-10-14 23:50:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:19,089 INFO L93 Difference]: Finished difference Result 10055 states and 13598 transitions. [2019-10-14 23:50:19,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:19,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-14 23:50:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:19,133 INFO L225 Difference]: With dead ends: 10055 [2019-10-14 23:50:19,133 INFO L226 Difference]: Without dead ends: 4859 [2019-10-14 23:50:19,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2019-10-14 23:50:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4855. [2019-10-14 23:50:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4855 states. [2019-10-14 23:50:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 5902 transitions. [2019-10-14 23:50:19,617 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 5902 transitions. Word has length 97 [2019-10-14 23:50:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:19,617 INFO L462 AbstractCegarLoop]: Abstraction has 4855 states and 5902 transitions. [2019-10-14 23:50:19,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 5902 transitions. [2019-10-14 23:50:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-14 23:50:19,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:19,624 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:19,833 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash -630281820, now seen corresponding path program 1 times [2019-10-14 23:50:19,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:19,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618030094] [2019-10-14 23:50:19,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:19,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:19,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-14 23:50:20,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618030094] [2019-10-14 23:50:20,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193960156] [2019-10-14 23:50:20,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:20,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-14 23:50:20,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:20,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-14 23:50:20,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434411531] [2019-10-14 23:50:20,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:20,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:20,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:50:20,233 INFO L87 Difference]: Start difference. First operand 4855 states and 5902 transitions. Second operand 3 states. [2019-10-14 23:50:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:20,428 INFO L93 Difference]: Finished difference Result 7362 states and 8967 transitions. [2019-10-14 23:50:20,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:20,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-14 23:50:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:20,451 INFO L225 Difference]: With dead ends: 7362 [2019-10-14 23:50:20,451 INFO L226 Difference]: Without dead ends: 3391 [2019-10-14 23:50:20,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:50:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2019-10-14 23:50:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 3391. [2019-10-14 23:50:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3391 states. [2019-10-14 23:50:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 4079 transitions. [2019-10-14 23:50:20,813 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 4079 transitions. Word has length 165 [2019-10-14 23:50:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:20,815 INFO L462 AbstractCegarLoop]: Abstraction has 3391 states and 4079 transitions. [2019-10-14 23:50:20,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 4079 transitions. [2019-10-14 23:50:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-14 23:50:20,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:20,821 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:21,034 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:21,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1714362604, now seen corresponding path program 1 times [2019-10-14 23:50:21,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:21,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538452240] [2019-10-14 23:50:21,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:21,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:21,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-14 23:50:21,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538452240] [2019-10-14 23:50:21,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220277232] [2019-10-14 23:50:21,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:21,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:50:21,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:21,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-10-14 23:50:21,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021757274] [2019-10-14 23:50:21,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:21,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:21,404 INFO L87 Difference]: Start difference. First operand 3391 states and 4079 transitions. Second operand 3 states. [2019-10-14 23:50:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:21,609 INFO L93 Difference]: Finished difference Result 7990 states and 9873 transitions. [2019-10-14 23:50:21,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:21,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-14 23:50:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:21,635 INFO L225 Difference]: With dead ends: 7990 [2019-10-14 23:50:21,636 INFO L226 Difference]: Without dead ends: 4625 [2019-10-14 23:50:21,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2019-10-14 23:50:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4622. [2019-10-14 23:50:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4622 states. [2019-10-14 23:50:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 5589 transitions. [2019-10-14 23:50:22,369 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 5589 transitions. Word has length 170 [2019-10-14 23:50:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:22,369 INFO L462 AbstractCegarLoop]: Abstraction has 4622 states and 5589 transitions. [2019-10-14 23:50:22,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 5589 transitions. [2019-10-14 23:50:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-14 23:50:22,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:22,376 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:22,580 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash -703541462, now seen corresponding path program 1 times [2019-10-14 23:50:22,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:22,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812864935] [2019-10-14 23:50:22,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:22,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:22,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-14 23:50:22,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812864935] [2019-10-14 23:50:22,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:22,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:50:22,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051596323] [2019-10-14 23:50:22,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:50:22,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:50:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:22,834 INFO L87 Difference]: Start difference. First operand 4622 states and 5589 transitions. Second operand 11 states. [2019-10-14 23:50:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:25,278 INFO L93 Difference]: Finished difference Result 11587 states and 14091 transitions. [2019-10-14 23:50:25,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 23:50:25,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2019-10-14 23:50:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:25,322 INFO L225 Difference]: With dead ends: 11587 [2019-10-14 23:50:25,322 INFO L226 Difference]: Without dead ends: 6991 [2019-10-14 23:50:25,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:50:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2019-10-14 23:50:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 6967. [2019-10-14 23:50:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6967 states. [2019-10-14 23:50:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6967 states to 6967 states and 8059 transitions. [2019-10-14 23:50:25,893 INFO L78 Accepts]: Start accepts. Automaton has 6967 states and 8059 transitions. Word has length 170 [2019-10-14 23:50:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:25,893 INFO L462 AbstractCegarLoop]: Abstraction has 6967 states and 8059 transitions. [2019-10-14 23:50:25,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:50:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 6967 states and 8059 transitions. [2019-10-14 23:50:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-14 23:50:25,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:25,903 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,903 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:25,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash 771902308, now seen corresponding path program 1 times [2019-10-14 23:50:25,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:25,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182165391] [2019-10-14 23:50:25,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:25,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:25,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 25 proven. 27 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-14 23:50:26,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182165391] [2019-10-14 23:50:26,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742650014] [2019-10-14 23:50:26,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 23:50:26,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-14 23:50:26,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:26,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2019-10-14 23:50:26,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66035088] [2019-10-14 23:50:26,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:50:26,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:26,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:50:26,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:26,586 INFO L87 Difference]: Start difference. First operand 6967 states and 8059 transitions. Second operand 6 states. [2019-10-14 23:50:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:27,716 INFO L93 Difference]: Finished difference Result 10395 states and 12052 transitions. [2019-10-14 23:50:27,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:27,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-10-14 23:50:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:27,741 INFO L225 Difference]: With dead ends: 10395 [2019-10-14 23:50:27,741 INFO L226 Difference]: Without dead ends: 5337 [2019-10-14 23:50:27,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:50:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5337 states. [2019-10-14 23:50:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5337 to 5300. [2019-10-14 23:50:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5300 states. [2019-10-14 23:50:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 6061 transitions. [2019-10-14 23:50:28,282 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 6061 transitions. Word has length 204 [2019-10-14 23:50:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:28,283 INFO L462 AbstractCegarLoop]: Abstraction has 5300 states and 6061 transitions. [2019-10-14 23:50:28,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:50:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 6061 transitions. [2019-10-14 23:50:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-14 23:50:28,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:28,294 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:28,498 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1674822886, now seen corresponding path program 1 times [2019-10-14 23:50:28,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:28,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615012633] [2019-10-14 23:50:28,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:28,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:28,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-14 23:50:28,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615012633] [2019-10-14 23:50:28,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:28,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:50:28,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349857372] [2019-10-14 23:50:28,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:50:28,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:28,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:50:28,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:28,762 INFO L87 Difference]: Start difference. First operand 5300 states and 6061 transitions. Second operand 11 states.