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/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:55,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:55,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:55,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:55,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:55,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:55,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:55,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:55,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:55,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:55,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:55,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:55,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:55,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:55,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:55,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:55,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:55,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:55,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:55,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:55,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:55,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:55,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:55,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:55,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:55,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:55,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:55,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:55,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:55,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:55,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:55,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:55,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:55,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:55,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:55,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:55,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:55,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:55,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:55,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:55,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:55,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:49:55,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:55,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:55,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:55,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:55,362 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:55,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:55,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:55,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:55,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:55,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:55,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:55,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:55,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:55,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:55,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:55,365 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:55,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:55,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:55,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:55,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:55,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:55,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:55,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:55,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:55,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:55,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:55,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:55,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:55,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:55,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:55,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:55,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:55,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:55,655 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:55,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-10-14 23:49:55,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e1a7f9f/879f2c257374488eb92da0815c91cf6f/FLAGdffd71aa9 [2019-10-14 23:49:56,189 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:56,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-10-14 23:49:56,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e1a7f9f/879f2c257374488eb92da0815c91cf6f/FLAGdffd71aa9 [2019-10-14 23:49:56,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e1a7f9f/879f2c257374488eb92da0815c91cf6f [2019-10-14 23:49:56,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:56,566 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:56,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:56,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:56,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:56,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:56" (1/1) ... [2019-10-14 23:49:56,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d9d827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:56, skipping insertion in model container [2019-10-14 23:49:56,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:56" (1/1) ... [2019-10-14 23:49:56,586 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:56,620 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:56,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:56,905 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:57,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:57,097 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:57,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57 WrapperNode [2019-10-14 23:49:57,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:57,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:57,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:57,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:57,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:57,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:57,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:57,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:57,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:49:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-10-14 23:49:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-10-14 23:49:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-10-14 23:49:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-10-14 23:49:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-10-14 23:49:57,258 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-10-14 23:49:57,258 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:49:57,258 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:49:57,258 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:49:57,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:49:57,259 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:49:57,259 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:49:57,259 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:49:57,259 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:49:57,260 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:49:57,260 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:49:57,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:49:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-10-14 23:49:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-10-14 23:49:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-10-14 23:49:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-10-14 23:49:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-10-14 23:49:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-10-14 23:49:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:49:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:49:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:49:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:49:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:49:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:49:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:49:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:49:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:49:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:49:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:57,748 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:57,748 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-14 23:49:57,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:57 BoogieIcfgContainer [2019-10-14 23:49:57,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:57,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:57,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:57,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:57,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:56" (1/3) ... [2019-10-14 23:49:57,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2012ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:57, skipping insertion in model container [2019-10-14 23:49:57,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (2/3) ... [2019-10-14 23:49:57,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2012ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:57, skipping insertion in model container [2019-10-14 23:49:57,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:57" (3/3) ... [2019-10-14 23:49:57,758 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-10-14 23:49:57,767 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:57,775 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:57,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:57,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:57,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:57,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:57,811 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:57,811 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:57,811 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:57,811 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:57,812 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-10-14 23:49:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:49:57,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,845 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] [2019-10-14 23:49:57,847 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash 4101629, now seen corresponding path program 1 times [2019-10-14 23:49:57,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56315823] [2019-10-14 23:49:57,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:58,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56315823] [2019-10-14 23:49:58,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:49:58,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107407826] [2019-10-14 23:49:58,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:49:58,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:49:58,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:49:58,527 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 10 states. [2019-10-14 23:50:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,892 INFO L93 Difference]: Finished difference Result 545 states and 904 transitions. [2019-10-14 23:50:00,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 23:50:00,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-14 23:50:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,913 INFO L225 Difference]: With dead ends: 545 [2019-10-14 23:50:00,913 INFO L226 Difference]: Without dead ends: 410 [2019-10-14 23:50:00,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:50:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-14 23:50:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 233. [2019-10-14 23:50:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-14 23:50:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2019-10-14 23:50:01,083 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2019-10-14 23:50:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,084 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2019-10-14 23:50:01,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2019-10-14 23:50:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:50:01,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,098 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] [2019-10-14 23:50:01,099 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1430979773, now seen corresponding path program 1 times [2019-10-14 23:50:01,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575125128] [2019-10-14 23:50:01,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:01,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575125128] [2019-10-14 23:50:01,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:01,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:01,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731662669] [2019-10-14 23:50:01,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:01,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:01,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:01,382 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 10 states. [2019-10-14 23:50:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:04,295 INFO L93 Difference]: Finished difference Result 798 states and 1152 transitions. [2019-10-14 23:50:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-14 23:50:04,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-14 23:50:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:04,302 INFO L225 Difference]: With dead ends: 798 [2019-10-14 23:50:04,302 INFO L226 Difference]: Without dead ends: 592 [2019-10-14 23:50:04,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2019-10-14 23:50:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-14 23:50:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 359. [2019-10-14 23:50:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-14 23:50:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2019-10-14 23:50:04,354 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2019-10-14 23:50:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,354 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2019-10-14 23:50:04,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2019-10-14 23:50:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:50:04,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,357 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] [2019-10-14 23:50:04,357 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1477202113, now seen corresponding path program 1 times [2019-10-14 23:50:04,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400281606] [2019-10-14 23:50:04,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:04,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400281606] [2019-10-14 23:50:04,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:50:04,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923963944] [2019-10-14 23:50:04,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:50:04,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:50:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:04,557 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 11 states. [2019-10-14 23:50:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:06,117 INFO L93 Difference]: Finished difference Result 854 states and 1203 transitions. [2019-10-14 23:50:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:06,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-10-14 23:50:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:06,122 INFO L225 Difference]: With dead ends: 854 [2019-10-14 23:50:06,122 INFO L226 Difference]: Without dead ends: 538 [2019-10-14 23:50:06,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-14 23:50:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 364. [2019-10-14 23:50:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-10-14 23:50:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2019-10-14 23:50:06,167 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2019-10-14 23:50:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:06,168 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2019-10-14 23:50:06,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:50:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2019-10-14 23:50:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:50:06,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:06,170 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] [2019-10-14 23:50:06,170 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1229055619, now seen corresponding path program 1 times [2019-10-14 23:50:06,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:06,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730394805] [2019-10-14 23:50:06,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:06,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730394805] [2019-10-14 23:50:06,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:06,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:06,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014601465] [2019-10-14 23:50:06,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:06,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:06,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:06,375 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 10 states. [2019-10-14 23:50:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:08,929 INFO L93 Difference]: Finished difference Result 1293 states and 1852 transitions. [2019-10-14 23:50:08,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:50:08,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-14 23:50:08,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:08,937 INFO L225 Difference]: With dead ends: 1293 [2019-10-14 23:50:08,937 INFO L226 Difference]: Without dead ends: 972 [2019-10-14 23:50:08,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:50:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-10-14 23:50:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 693. [2019-10-14 23:50:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-10-14 23:50:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 897 transitions. [2019-10-14 23:50:09,051 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 897 transitions. Word has length 78 [2019-10-14 23:50:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:09,051 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 897 transitions. [2019-10-14 23:50:09,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 897 transitions. [2019-10-14 23:50:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:50:09,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:09,054 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] [2019-10-14 23:50:09,054 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash 650743635, now seen corresponding path program 1 times [2019-10-14 23:50:09,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:09,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714385186] [2019-10-14 23:50:09,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:09,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:09,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:09,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714385186] [2019-10-14 23:50:09,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:09,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:50:09,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779251467] [2019-10-14 23:50:09,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:50:09,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:50:09,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:09,249 INFO L87 Difference]: Start difference. First operand 693 states and 897 transitions. Second operand 11 states. [2019-10-14 23:50:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:11,000 INFO L93 Difference]: Finished difference Result 1615 states and 2204 transitions. [2019-10-14 23:50:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:50:11,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-10-14 23:50:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:11,007 INFO L225 Difference]: With dead ends: 1615 [2019-10-14 23:50:11,007 INFO L226 Difference]: Without dead ends: 965 [2019-10-14 23:50:11,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:50:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-10-14 23:50:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 708. [2019-10-14 23:50:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-10-14 23:50:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 909 transitions. [2019-10-14 23:50:11,076 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 909 transitions. Word has length 78 [2019-10-14 23:50:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:11,076 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 909 transitions. [2019-10-14 23:50:11,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:50:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 909 transitions. [2019-10-14 23:50:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:50:11,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:11,078 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] [2019-10-14 23:50:11,078 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash 578357077, now seen corresponding path program 1 times [2019-10-14 23:50:11,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:11,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909314294] [2019-10-14 23:50:11,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:11,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909314294] [2019-10-14 23:50:11,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:11,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:11,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933060240] [2019-10-14 23:50:11,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:11,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:11,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:11,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:11,302 INFO L87 Difference]: Start difference. First operand 708 states and 909 transitions. Second operand 10 states. [2019-10-14 23:50:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:13,895 INFO L93 Difference]: Finished difference Result 1671 states and 2254 transitions. [2019-10-14 23:50:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-14 23:50:13,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-14 23:50:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:13,903 INFO L225 Difference]: With dead ends: 1671 [2019-10-14 23:50:13,904 INFO L226 Difference]: Without dead ends: 1105 [2019-10-14 23:50:13,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2019-10-14 23:50:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-10-14 23:50:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 724. [2019-10-14 23:50:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-14 23:50:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 918 transitions. [2019-10-14 23:50:13,972 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 918 transitions. Word has length 78 [2019-10-14 23:50:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:13,972 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 918 transitions. [2019-10-14 23:50:13,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 918 transitions. [2019-10-14 23:50:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:50:13,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:13,974 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] [2019-10-14 23:50:13,974 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash 68883987, now seen corresponding path program 1 times [2019-10-14 23:50:13,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:13,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276217856] [2019-10-14 23:50:13,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:14,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276217856] [2019-10-14 23:50:14,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:14,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:50:14,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365704792] [2019-10-14 23:50:14,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:50:14,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:14,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:50:14,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:14,125 INFO L87 Difference]: Start difference. First operand 724 states and 918 transitions. Second operand 8 states. [2019-10-14 23:50:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:16,360 INFO L93 Difference]: Finished difference Result 2460 states and 3468 transitions. [2019-10-14 23:50:16,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:50:16,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-10-14 23:50:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:16,373 INFO L225 Difference]: With dead ends: 2460 [2019-10-14 23:50:16,373 INFO L226 Difference]: Without dead ends: 1807 [2019-10-14 23:50:16,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2019-10-14 23:50:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1392. [2019-10-14 23:50:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-10-14 23:50:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1789 transitions. [2019-10-14 23:50:16,503 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1789 transitions. Word has length 78 [2019-10-14 23:50:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:16,504 INFO L462 AbstractCegarLoop]: Abstraction has 1392 states and 1789 transitions. [2019-10-14 23:50:16,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:50:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1789 transitions. [2019-10-14 23:50:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-14 23:50:16,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:16,507 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] [2019-10-14 23:50:16,507 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:16,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:16,507 INFO L82 PathProgramCache]: Analyzing trace with hash 173246819, now seen corresponding path program 1 times [2019-10-14 23:50:16,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:16,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078185701] [2019-10-14 23:50:16,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:16,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:16,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:16,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078185701] [2019-10-14 23:50:16,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:16,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:50:16,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850238013] [2019-10-14 23:50:16,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:50:16,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:16,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:50:16,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:16,820 INFO L87 Difference]: Start difference. First operand 1392 states and 1789 transitions. Second operand 8 states. [2019-10-14 23:50:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:18,545 INFO L93 Difference]: Finished difference Result 4302 states and 5953 transitions. [2019-10-14 23:50:18,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:50:18,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-10-14 23:50:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:18,562 INFO L225 Difference]: With dead ends: 4302 [2019-10-14 23:50:18,563 INFO L226 Difference]: Without dead ends: 2927 [2019-10-14 23:50:18,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-10-14 23:50:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2582. [2019-10-14 23:50:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2019-10-14 23:50:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3439 transitions. [2019-10-14 23:50:18,796 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3439 transitions. Word has length 79 [2019-10-14 23:50:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:18,797 INFO L462 AbstractCegarLoop]: Abstraction has 2582 states and 3439 transitions. [2019-10-14 23:50:18,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:50:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3439 transitions. [2019-10-14 23:50:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-14 23:50:18,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:18,800 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] [2019-10-14 23:50:18,800 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash -62333690, now seen corresponding path program 1 times [2019-10-14 23:50:18,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:18,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611840086] [2019-10-14 23:50:18,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:18,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:18,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:19,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611840086] [2019-10-14 23:50:19,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:19,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:19,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760427077] [2019-10-14 23:50:19,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:19,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:19,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:19,004 INFO L87 Difference]: Start difference. First operand 2582 states and 3439 transitions. Second operand 10 states. [2019-10-14 23:50:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:20,657 INFO L93 Difference]: Finished difference Result 5325 states and 7144 transitions. [2019-10-14 23:50:20,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:50:20,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-10-14 23:50:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:20,678 INFO L225 Difference]: With dead ends: 5325 [2019-10-14 23:50:20,678 INFO L226 Difference]: Without dead ends: 2799 [2019-10-14 23:50:20,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-10-14 23:50:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2561. [2019-10-14 23:50:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2561 states. [2019-10-14 23:50:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3448 transitions. [2019-10-14 23:50:21,020 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3448 transitions. Word has length 87 [2019-10-14 23:50:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:21,020 INFO L462 AbstractCegarLoop]: Abstraction has 2561 states and 3448 transitions. [2019-10-14 23:50:21,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3448 transitions. [2019-10-14 23:50:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-14 23:50:21,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:21,022 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] [2019-10-14 23:50:21,022 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1970791480, now seen corresponding path program 1 times [2019-10-14 23:50:21,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:21,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557195386] [2019-10-14 23:50:21,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:21,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:21,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:21,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557195386] [2019-10-14 23:50:21,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:21,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:50:21,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907927405] [2019-10-14 23:50:21,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:50:21,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:50:21,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:21,298 INFO L87 Difference]: Start difference. First operand 2561 states and 3448 transitions. Second operand 11 states. [2019-10-14 23:50:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:24,604 INFO L93 Difference]: Finished difference Result 8043 states and 11461 transitions. [2019-10-14 23:50:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-14 23:50:24,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-10-14 23:50:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:24,635 INFO L225 Difference]: With dead ends: 8043 [2019-10-14 23:50:24,636 INFO L226 Difference]: Without dead ends: 5537 [2019-10-14 23:50:24,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-10-14 23:50:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5537 states. [2019-10-14 23:50:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5537 to 5093. [2019-10-14 23:50:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5093 states. [2019-10-14 23:50:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5093 states to 5093 states and 7025 transitions. [2019-10-14 23:50:25,231 INFO L78 Accepts]: Start accepts. Automaton has 5093 states and 7025 transitions. Word has length 87 [2019-10-14 23:50:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:25,233 INFO L462 AbstractCegarLoop]: Abstraction has 5093 states and 7025 transitions. [2019-10-14 23:50:25,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:50:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5093 states and 7025 transitions. [2019-10-14 23:50:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-14 23:50:25,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:25,238 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:25,239 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1829324777, now seen corresponding path program 1 times [2019-10-14 23:50:25,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:25,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638190353] [2019-10-14 23:50:25,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:25,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:25,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:25,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638190353] [2019-10-14 23:50:25,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:25,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:25,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542512490] [2019-10-14 23:50:25,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:25,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:25,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:25,425 INFO L87 Difference]: Start difference. First operand 5093 states and 7025 transitions. Second operand 10 states. [2019-10-14 23:50:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:27,874 INFO L93 Difference]: Finished difference Result 6999 states and 9553 transitions. [2019-10-14 23:50:27,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 23:50:27,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-10-14 23:50:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:27,910 INFO L225 Difference]: With dead ends: 6999 [2019-10-14 23:50:27,910 INFO L226 Difference]: Without dead ends: 6996 [2019-10-14 23:50:27,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2019-10-14 23:50:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2019-10-14 23:50:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 6389. [2019-10-14 23:50:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6389 states. [2019-10-14 23:50:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6389 states to 6389 states and 8746 transitions. [2019-10-14 23:50:28,459 INFO L78 Accepts]: Start accepts. Automaton has 6389 states and 8746 transitions. Word has length 88 [2019-10-14 23:50:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:28,459 INFO L462 AbstractCegarLoop]: Abstraction has 6389 states and 8746 transitions. [2019-10-14 23:50:28,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6389 states and 8746 transitions. [2019-10-14 23:50:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-14 23:50:28,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:28,461 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:28,461 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:28,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash -874813360, now seen corresponding path program 1 times [2019-10-14 23:50:28,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:28,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865229792] [2019-10-14 23:50:28,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:28,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:28,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:28,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865229792] [2019-10-14 23:50:28,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483922807] [2019-10-14 23:50:28,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 23:50:28,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:29,053 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:29,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2019-10-14 23:50:29,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746604039] [2019-10-14 23:50:29,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 23:50:29,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 23:50:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:29,054 INFO L87 Difference]: Start difference. First operand 6389 states and 8746 transitions. Second operand 17 states.