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-f4eb214f-m [2019-10-13 19:50:53,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:53,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:53,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:53,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:53,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:53,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:53,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:53,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:53,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:53,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:53,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:53,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:53,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:53,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:53,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:53,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:53,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:53,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:53,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:53,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:53,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:53,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:53,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:53,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:53,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:53,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:53,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:53,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:53,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:53,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:53,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:53,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:53,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:53,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:53,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:53,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:53,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:53,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:53,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:53,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:53,100 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-13 19:50:53,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:53,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:53,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:53,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:53,121 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:53,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:53,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:53,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:53,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:53,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:53,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:53,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:53,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:53,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:53,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:53,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:53,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:53,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:53,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:53,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:53,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:53,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:53,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:53,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:53,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:53,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:53,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:53,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:53,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:53,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:53,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:53,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:53,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:53,437 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:53,438 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-13 19:50:53,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67202704/6af3e7d35c754fa4ac14c1fd77b2f5c7/FLAG9fbafda5b [2019-10-13 19:50:54,067 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:54,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-13 19:50:54,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67202704/6af3e7d35c754fa4ac14c1fd77b2f5c7/FLAG9fbafda5b [2019-10-13 19:50:54,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67202704/6af3e7d35c754fa4ac14c1fd77b2f5c7 [2019-10-13 19:50:54,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:54,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:54,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:54,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:54,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:54,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:54" (1/1) ... [2019-10-13 19:50:54,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eff805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:54, skipping insertion in model container [2019-10-13 19:50:54,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:54" (1/1) ... [2019-10-13 19:50:54,439 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:54,498 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:54,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:54,872 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:54,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:55,014 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:55,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55 WrapperNode [2019-10-13 19:50:55,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:55,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:55,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:55,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:55,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (1/1) ... [2019-10-13 19:50:55,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:55,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:55,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:55,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:55,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50: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-13 19:50:55,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:55,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 19:50:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-13 19:50:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-13 19:50:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-13 19:50:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-13 19:50:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-13 19:50:55,132 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-13 19:50:55,132 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 19:50:55,132 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 19:50:55,132 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 19:50:55,133 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 19:50:55,133 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 19:50:55,133 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 19:50:55,133 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 19:50:55,133 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 19:50:55,134 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 19:50:55,134 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 19:50:55,134 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 19:50:55,134 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 19:50:55,134 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 19:50:55,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 19:50:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 19:50:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-13 19:50:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-13 19:50:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-13 19:50:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-13 19:50:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-13 19:50:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-13 19:50:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 19:50:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 19:50:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 19:50:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 19:50:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 19:50:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 19:50:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 19:50:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 19:50:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 19:50:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 19:50:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 19:50:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 19:50:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:55,682 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:55,683 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 19:50:55,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:55 BoogieIcfgContainer [2019-10-13 19:50:55,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:55,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:55,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:55,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:54" (1/3) ... [2019-10-13 19:50:55,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be18718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:55, skipping insertion in model container [2019-10-13 19:50:55,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:55" (2/3) ... [2019-10-13 19:50:55,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be18718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:55, skipping insertion in model container [2019-10-13 19:50:55,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:55" (3/3) ... [2019-10-13 19:50:55,703 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2019-10-13 19:50:55,715 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:55,739 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:55,752 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:55,781 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:55,781 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:55,782 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:55,782 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:55,782 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:55,782 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:55,782 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:55,783 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-13 19:50:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 19:50:55,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,818 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-13 19:50:55,819 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,824 INFO L82 PathProgramCache]: Analyzing trace with hash -798642762, now seen corresponding path program 1 times [2019-10-13 19:50:55,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792464033] [2019-10-13 19:50:55,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,395 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-13 19:50:56,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792464033] [2019-10-13 19:50:56,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:50:56,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190880134] [2019-10-13 19:50:56,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:50:56,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:50:56,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:50:56,422 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 7 states. [2019-10-13 19:50:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,251 INFO L93 Difference]: Finished difference Result 438 states and 619 transitions. [2019-10-13 19:50:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:50:58,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-10-13 19:50:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,272 INFO L225 Difference]: With dead ends: 438 [2019-10-13 19:50:58,272 INFO L226 Difference]: Without dead ends: 294 [2019-10-13 19:50:58,281 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-13 19:50:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-13 19:50:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 256. [2019-10-13 19:50:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-13 19:50:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 331 transitions. [2019-10-13 19:50:58,394 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 331 transitions. Word has length 72 [2019-10-13 19:50:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,395 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 331 transitions. [2019-10-13 19:50:58,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:50:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2019-10-13 19:50:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 19:50:58,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,405 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-13 19:50:58,406 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1672120457, now seen corresponding path program 1 times [2019-10-13 19:50:58,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012005935] [2019-10-13 19:50:58,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,730 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-13 19:50:58,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012005935] [2019-10-13 19:50:58,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:50:58,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507019374] [2019-10-13 19:50:58,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:50:58,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:50:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:50:58,738 INFO L87 Difference]: Start difference. First operand 256 states and 331 transitions. Second operand 7 states. [2019-10-13 19:51:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,187 INFO L93 Difference]: Finished difference Result 767 states and 1035 transitions. [2019-10-13 19:51:00,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:00,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-10-13 19:51:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,195 INFO L225 Difference]: With dead ends: 767 [2019-10-13 19:51:00,195 INFO L226 Difference]: Without dead ends: 531 [2019-10-13 19:51:00,198 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-13 19:51:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-13 19:51:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 474. [2019-10-13 19:51:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-13 19:51:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 611 transitions. [2019-10-13 19:51:00,311 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 611 transitions. Word has length 72 [2019-10-13 19:51:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,311 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 611 transitions. [2019-10-13 19:51:00,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:51:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 611 transitions. [2019-10-13 19:51:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 19:51:00,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,322 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-13 19:51:00,322 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,322 INFO L82 PathProgramCache]: Analyzing trace with hash -539585734, now seen corresponding path program 1 times [2019-10-13 19:51:00,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090813129] [2019-10-13 19:51:00,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,535 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-13 19:51:00,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090813129] [2019-10-13 19:51:00,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:51:00,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927385791] [2019-10-13 19:51:00,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:51:00,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:51:00,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:51:00,537 INFO L87 Difference]: Start difference. First operand 474 states and 611 transitions. Second operand 7 states. [2019-10-13 19:51:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,885 INFO L93 Difference]: Finished difference Result 1217 states and 1631 transitions. [2019-10-13 19:51:01,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:01,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-10-13 19:51:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,893 INFO L225 Difference]: With dead ends: 1217 [2019-10-13 19:51:01,893 INFO L226 Difference]: Without dead ends: 763 [2019-10-13 19:51:01,896 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-13 19:51:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-10-13 19:51:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 678. [2019-10-13 19:51:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-13 19:51:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 869 transitions. [2019-10-13 19:51:01,961 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 869 transitions. Word has length 73 [2019-10-13 19:51:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,962 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 869 transitions. [2019-10-13 19:51:01,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:51:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 869 transitions. [2019-10-13 19:51:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 19:51:01,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,964 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-13 19:51:01,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1990564953, now seen corresponding path program 1 times [2019-10-13 19:51:01,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867223638] [2019-10-13 19:51:01,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,162 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-13 19:51:02,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867223638] [2019-10-13 19:51:02,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:02,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:02,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176189236] [2019-10-13 19:51:02,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:02,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:02,165 INFO L87 Difference]: Start difference. First operand 678 states and 869 transitions. Second operand 9 states. [2019-10-13 19:51:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,340 INFO L93 Difference]: Finished difference Result 1406 states and 1827 transitions. [2019-10-13 19:51:03,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:03,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-10-13 19:51:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,347 INFO L225 Difference]: With dead ends: 1406 [2019-10-13 19:51:03,347 INFO L226 Difference]: Without dead ends: 748 [2019-10-13 19:51:03,351 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-13 19:51:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-13 19:51:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 693. [2019-10-13 19:51:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-10-13 19:51:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 881 transitions. [2019-10-13 19:51:03,420 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 881 transitions. Word has length 73 [2019-10-13 19:51:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,421 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 881 transitions. [2019-10-13 19:51:03,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 881 transitions. [2019-10-13 19:51:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 19:51:03,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,428 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-13 19:51:03,430 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,431 INFO L82 PathProgramCache]: Analyzing trace with hash 618757655, now seen corresponding path program 1 times [2019-10-13 19:51:03,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192648440] [2019-10-13 19:51:03,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,657 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-13 19:51:03,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192648440] [2019-10-13 19:51:03,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:03,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607972043] [2019-10-13 19:51:03,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:03,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:03,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:03,661 INFO L87 Difference]: Start difference. First operand 693 states and 881 transitions. Second operand 9 states. [2019-10-13 19:51:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,976 INFO L93 Difference]: Finished difference Result 1441 states and 1858 transitions. [2019-10-13 19:51:04,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:51:04,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-10-13 19:51:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,982 INFO L225 Difference]: With dead ends: 1441 [2019-10-13 19:51:04,982 INFO L226 Difference]: Without dead ends: 768 [2019-10-13 19:51:04,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:51:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-10-13 19:51:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 713. [2019-10-13 19:51:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-10-13 19:51:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 899 transitions. [2019-10-13 19:51:05,054 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 899 transitions. Word has length 73 [2019-10-13 19:51:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:05,054 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 899 transitions. [2019-10-13 19:51:05,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 899 transitions. [2019-10-13 19:51:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 19:51:05,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:05,056 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-13 19:51:05,056 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:05,057 INFO L82 PathProgramCache]: Analyzing trace with hash 641389909, now seen corresponding path program 1 times [2019-10-13 19:51:05,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:05,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974658637] [2019-10-13 19:51:05,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:05,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974658637] [2019-10-13 19:51:05,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:05,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:05,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362941792] [2019-10-13 19:51:05,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:05,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:05,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:05,242 INFO L87 Difference]: Start difference. First operand 713 states and 899 transitions. Second operand 9 states. [2019-10-13 19:51:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:06,831 INFO L93 Difference]: Finished difference Result 1504 states and 1933 transitions. [2019-10-13 19:51:06,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 19:51:06,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-10-13 19:51:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:06,842 INFO L225 Difference]: With dead ends: 1504 [2019-10-13 19:51:06,843 INFO L226 Difference]: Without dead ends: 905 [2019-10-13 19:51:06,847 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-13 19:51:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-10-13 19:51:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 830. [2019-10-13 19:51:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-10-13 19:51:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1049 transitions. [2019-10-13 19:51:06,945 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1049 transitions. Word has length 73 [2019-10-13 19:51:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,946 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1049 transitions. [2019-10-13 19:51:06,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1049 transitions. [2019-10-13 19:51:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 19:51:06,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,949 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-13 19:51:06,949 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,950 INFO L82 PathProgramCache]: Analyzing trace with hash 298865229, now seen corresponding path program 1 times [2019-10-13 19:51:06,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724565897] [2019-10-13 19:51:06,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,206 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-13 19:51:07,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724565897] [2019-10-13 19:51:07,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:07,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 19:51:07,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381000407] [2019-10-13 19:51:07,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:51:07,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:51:07,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:51:07,214 INFO L87 Difference]: Start difference. First operand 830 states and 1049 transitions. Second operand 12 states. [2019-10-13 19:51:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:10,750 INFO L93 Difference]: Finished difference Result 1688 states and 2262 transitions. [2019-10-13 19:51:10,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-13 19:51:10,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-10-13 19:51:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:10,759 INFO L225 Difference]: With dead ends: 1688 [2019-10-13 19:51:10,759 INFO L226 Difference]: Without dead ends: 1198 [2019-10-13 19:51:10,763 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-13 19:51:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-10-13 19:51:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1031. [2019-10-13 19:51:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-10-13 19:51:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1353 transitions. [2019-10-13 19:51:10,848 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1353 transitions. Word has length 86 [2019-10-13 19:51:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:10,848 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1353 transitions. [2019-10-13 19:51:10,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:51:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1353 transitions. [2019-10-13 19:51:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 19:51:10,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:10,850 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-13 19:51:10,850 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash -681624608, now seen corresponding path program 1 times [2019-10-13 19:51:10,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:10,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247103733] [2019-10-13 19:51:10,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:10,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:10,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,194 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-13 19:51:11,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247103733] [2019-10-13 19:51:11,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:11,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 19:51:11,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961084913] [2019-10-13 19:51:11,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 19:51:11,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:11,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 19:51:11,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:51:11,197 INFO L87 Difference]: Start difference. First operand 1031 states and 1353 transitions. Second operand 14 states. [2019-10-13 19:51:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:15,552 INFO L93 Difference]: Finished difference Result 2366 states and 3267 transitions. [2019-10-13 19:51:15,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 19:51:15,552 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2019-10-13 19:51:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:15,563 INFO L225 Difference]: With dead ends: 2366 [2019-10-13 19:51:15,564 INFO L226 Difference]: Without dead ends: 1825 [2019-10-13 19:51:15,568 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-13 19:51:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-10-13 19:51:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1529. [2019-10-13 19:51:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1529 states. [2019-10-13 19:51:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2046 transitions. [2019-10-13 19:51:15,681 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2046 transitions. Word has length 90 [2019-10-13 19:51:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:15,682 INFO L462 AbstractCegarLoop]: Abstraction has 1529 states and 2046 transitions. [2019-10-13 19:51:15,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 19:51:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2046 transitions. [2019-10-13 19:51:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:15,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:15,684 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-13 19:51:15,684 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1835313196, now seen corresponding path program 1 times [2019-10-13 19:51:15,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:15,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434498679] [2019-10-13 19:51:15,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,865 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-13 19:51:15,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434498679] [2019-10-13 19:51:15,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502494346] [2019-10-13 19:51:15,867 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-13 19:51:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:16,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:16,080 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-13 19:51:16,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:16,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2019-10-13 19:51:16,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341679499] [2019-10-13 19:51:16,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:16,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:16,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:51:16,083 INFO L87 Difference]: Start difference. First operand 1529 states and 2046 transitions. Second operand 3 states. [2019-10-13 19:51:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:16,277 INFO L93 Difference]: Finished difference Result 4357 states and 6479 transitions. [2019-10-13 19:51:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:16,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-13 19:51:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:16,299 INFO L225 Difference]: With dead ends: 4357 [2019-10-13 19:51:16,299 INFO L226 Difference]: Without dead ends: 2849 [2019-10-13 19:51:16,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:51:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2019-10-13 19:51:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2845. [2019-10-13 19:51:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-10-13 19:51:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4087 transitions. [2019-10-13 19:51:16,585 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4087 transitions. Word has length 92 [2019-10-13 19:51:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:16,585 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 4087 transitions. [2019-10-13 19:51:16,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4087 transitions. [2019-10-13 19:51:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 19:51:16,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:16,588 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-13 19:51:16,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:16,794 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1113521566, now seen corresponding path program 1 times [2019-10-13 19:51:16,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:16,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402422651] [2019-10-13 19:51:16,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:16,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:16,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 19:51:16,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402422651] [2019-10-13 19:51:16,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:16,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:51:16,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381667441] [2019-10-13 19:51:16,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:51:16,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:51:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:51:16,914 INFO L87 Difference]: Start difference. First operand 2845 states and 4087 transitions. Second operand 8 states. [2019-10-13 19:51:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:17,948 INFO L93 Difference]: Finished difference Result 6220 states and 9054 transitions. [2019-10-13 19:51:17,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:17,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-10-13 19:51:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:17,976 INFO L225 Difference]: With dead ends: 6220 [2019-10-13 19:51:17,976 INFO L226 Difference]: Without dead ends: 3396 [2019-10-13 19:51:17,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:51:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2019-10-13 19:51:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3080. [2019-10-13 19:51:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-10-13 19:51:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4486 transitions. [2019-10-13 19:51:18,438 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4486 transitions. Word has length 94 [2019-10-13 19:51:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:18,438 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 4486 transitions. [2019-10-13 19:51:18,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:51:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4486 transitions. [2019-10-13 19:51:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 19:51:18,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:18,442 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-13 19:51:18,442 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:18,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:18,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1952555228, now seen corresponding path program 1 times [2019-10-13 19:51:18,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:18,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553494792] [2019-10-13 19:51:18,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:18,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:18,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,611 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-13 19:51:18,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553494792] [2019-10-13 19:51:18,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246539535] [2019-10-13 19:51:18,612 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-13 19:51:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:18,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:18,803 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-13 19:51:18,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:18,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2019-10-13 19:51:18,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157088680] [2019-10-13 19:51:18,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:18,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:18,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:18,807 INFO L87 Difference]: Start difference. First operand 3080 states and 4486 transitions. Second operand 3 states. [2019-10-13 19:51:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:19,358 INFO L93 Difference]: Finished difference Result 8546 states and 13078 transitions. [2019-10-13 19:51:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:19,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-13 19:51:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:19,397 INFO L225 Difference]: With dead ends: 8546 [2019-10-13 19:51:19,397 INFO L226 Difference]: Without dead ends: 5487 [2019-10-13 19:51:19,430 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-13 19:51:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5487 states. [2019-10-13 19:51:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5487 to 5423. [2019-10-13 19:51:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5423 states. [2019-10-13 19:51:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5423 states to 5423 states and 7311 transitions. [2019-10-13 19:51:19,923 INFO L78 Accepts]: Start accepts. Automaton has 5423 states and 7311 transitions. Word has length 94 [2019-10-13 19:51:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:19,924 INFO L462 AbstractCegarLoop]: Abstraction has 5423 states and 7311 transitions. [2019-10-13 19:51:19,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5423 states and 7311 transitions. [2019-10-13 19:51:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 19:51:19,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:19,926 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-13 19:51:20,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:20,131 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:20,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1028804159, now seen corresponding path program 1 times [2019-10-13 19:51:20,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:20,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808198349] [2019-10-13 19:51:20,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:20,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:20,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,338 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-13 19:51:20,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808198349] [2019-10-13 19:51:20,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077147695] [2019-10-13 19:51:20,339 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-13 19:51:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:20,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:20,446 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-13 19:51:20,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:20,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-10-13 19:51:20,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435303461] [2019-10-13 19:51:20,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:20,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:51:20,448 INFO L87 Difference]: Start difference. First operand 5423 states and 7311 transitions. Second operand 3 states. [2019-10-13 19:51:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:20,911 INFO L93 Difference]: Finished difference Result 10645 states and 14480 transitions. [2019-10-13 19:51:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:20,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 19:51:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:20,953 INFO L225 Difference]: With dead ends: 10645 [2019-10-13 19:51:20,953 INFO L226 Difference]: Without dead ends: 5159 [2019-10-13 19:51:20,988 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-13 19:51:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5159 states. [2019-10-13 19:51:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5159 to 5137. [2019-10-13 19:51:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5137 states. [2019-10-13 19:51:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5137 states to 5137 states and 6293 transitions. [2019-10-13 19:51:21,518 INFO L78 Accepts]: Start accepts. Automaton has 5137 states and 6293 transitions. Word has length 97 [2019-10-13 19:51:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:21,518 INFO L462 AbstractCegarLoop]: Abstraction has 5137 states and 6293 transitions. [2019-10-13 19:51:21,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5137 states and 6293 transitions. [2019-10-13 19:51:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 19:51:21,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:21,526 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-13 19:51:21,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:21,731 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:21,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash -630281820, now seen corresponding path program 1 times [2019-10-13 19:51:21,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:21,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845729831] [2019-10-13 19:51:21,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:21,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:21,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:21,935 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-13 19:51:21,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845729831] [2019-10-13 19:51:21,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646813798] [2019-10-13 19:51:21,936 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-13 19:51:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:22,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:22,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:22,199 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-13 19:51:22,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:22,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-13 19:51:22,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523662255] [2019-10-13 19:51:22,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:22,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:22,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:51:22,205 INFO L87 Difference]: Start difference. First operand 5137 states and 6293 transitions. Second operand 3 states. [2019-10-13 19:51:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:22,458 INFO L93 Difference]: Finished difference Result 7815 states and 9605 transitions. [2019-10-13 19:51:22,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:22,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-13 19:51:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:22,491 INFO L225 Difference]: With dead ends: 7815 [2019-10-13 19:51:22,492 INFO L226 Difference]: Without dead ends: 3608 [2019-10-13 19:51:22,500 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-13 19:51:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2019-10-13 19:51:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3607. [2019-10-13 19:51:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3607 states. [2019-10-13 19:51:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 4375 transitions. [2019-10-13 19:51:22,796 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 4375 transitions. Word has length 165 [2019-10-13 19:51:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:22,798 INFO L462 AbstractCegarLoop]: Abstraction has 3607 states and 4375 transitions. [2019-10-13 19:51:22,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 4375 transitions. [2019-10-13 19:51:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 19:51:22,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:22,803 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-13 19:51:23,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:23,008 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1714362604, now seen corresponding path program 1 times [2019-10-13 19:51:23,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:23,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647354987] [2019-10-13 19:51:23,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:23,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:23,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,200 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-13 19:51:23,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647354987] [2019-10-13 19:51:23,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708078279] [2019-10-13 19:51:23,200 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-13 19:51:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:23,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:23,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:23,452 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-13 19:51:23,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:23,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-10-13 19:51:23,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272076576] [2019-10-13 19:51:23,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:23,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:23,454 INFO L87 Difference]: Start difference. First operand 3607 states and 4375 transitions. Second operand 3 states. [2019-10-13 19:51:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:23,808 INFO L93 Difference]: Finished difference Result 8492 states and 10571 transitions. [2019-10-13 19:51:23,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:23,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-13 19:51:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:23,838 INFO L225 Difference]: With dead ends: 8492 [2019-10-13 19:51:23,838 INFO L226 Difference]: Without dead ends: 4911 [2019-10-13 19:51:23,850 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-13 19:51:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2019-10-13 19:51:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4908. [2019-10-13 19:51:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4908 states. [2019-10-13 19:51:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 5983 transitions. [2019-10-13 19:51:24,307 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 5983 transitions. Word has length 170 [2019-10-13 19:51:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:24,307 INFO L462 AbstractCegarLoop]: Abstraction has 4908 states and 5983 transitions. [2019-10-13 19:51:24,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 5983 transitions. [2019-10-13 19:51:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 19:51:24,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:24,314 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-13 19:51:24,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:24,527 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:24,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:24,527 INFO L82 PathProgramCache]: Analyzing trace with hash -703541462, now seen corresponding path program 1 times [2019-10-13 19:51:24,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:24,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259493974] [2019-10-13 19:51:24,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:24,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:24,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:24,847 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-13 19:51:24,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259493974] [2019-10-13 19:51:24,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:24,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 19:51:24,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224288592] [2019-10-13 19:51:24,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:51:24,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:51:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:51:24,851 INFO L87 Difference]: Start difference. First operand 4908 states and 5983 transitions. Second operand 11 states. [2019-10-13 19:51:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:27,386 INFO L93 Difference]: Finished difference Result 11900 states and 14547 transitions. [2019-10-13 19:51:27,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 19:51:27,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2019-10-13 19:51:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:27,422 INFO L225 Difference]: With dead ends: 11900 [2019-10-13 19:51:27,422 INFO L226 Difference]: Without dead ends: 7018 [2019-10-13 19:51:27,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2019-10-13 19:51:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7018 states. [2019-10-13 19:51:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7018 to 6994. [2019-10-13 19:51:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6994 states. [2019-10-13 19:51:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 8096 transitions. [2019-10-13 19:51:27,975 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 8096 transitions. Word has length 170 [2019-10-13 19:51:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:27,978 INFO L462 AbstractCegarLoop]: Abstraction has 6994 states and 8096 transitions. [2019-10-13 19:51:27,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:51:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 8096 transitions. [2019-10-13 19:51:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-13 19:51:27,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:27,990 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-13 19:51:27,990 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:27,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash 771902308, now seen corresponding path program 1 times [2019-10-13 19:51:27,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:27,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296822196] [2019-10-13 19:51:27,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:27,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:27,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,391 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-13 19:51:28,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296822196] [2019-10-13 19:51:28,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715845] [2019-10-13 19:51:28,392 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