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-fea9116 [2019-09-20 13:08:25,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:08:25,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:08:25,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:08:25,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:08:25,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:08:25,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:08:25,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:08:25,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:08:25,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:08:25,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:08:25,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:08:25,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:08:25,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:08:25,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:08:25,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:08:25,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:08:25,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:08:25,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:08:25,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:08:25,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:08:25,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:08:25,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:08:25,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:08:25,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:08:25,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:08:25,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:08:25,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:08:25,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:08:25,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:08:25,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:08:25,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:08:25,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:08:25,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:08:25,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:08:25,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:08:25,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:08:25,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:08:25,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:08:25,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:08:25,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:08:25,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:08:25,489 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:08:25,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:08:25,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:08:25,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:08:25,492 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:08:25,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:08:25,492 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:08:25,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:08:25,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:08:25,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:08:25,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:08:25,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:08:25,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:08:25,495 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:08:25,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:08:25,495 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:08:25,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:08:25,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:08:25,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:08:25,496 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:08:25,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:08:25,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:25,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:08:25,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:08:25,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:08:25,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:08:25,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:08:25,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:08:25,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:08:25,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:08:25,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:08:25,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:08:25,547 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:08:25,548 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:08:25,548 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-09-20 13:08:25,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba784085/93056c547e1947e88867f86ce61bad0b/FLAG3601bb4ec [2019-09-20 13:08:26,070 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:08:26,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-09-20 13:08:26,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba784085/93056c547e1947e88867f86ce61bad0b/FLAG3601bb4ec [2019-09-20 13:08:26,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba784085/93056c547e1947e88867f86ce61bad0b [2019-09-20 13:08:26,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:08:26,435 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:08:26,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:26,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:08:26,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:08:26,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:26" (1/1) ... [2019-09-20 13:08:26,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616dfd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:26, skipping insertion in model container [2019-09-20 13:08:26,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:26" (1/1) ... [2019-09-20 13:08:26,450 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:08:26,492 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:08:26,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:26,807 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:08:27,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:27,065 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:08:27,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27 WrapperNode [2019-09-20 13:08:27,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:27,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:08:27,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:08:27,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:08:27,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (1/1) ... [2019-09-20 13:08:27,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (1/1) ... [2019-09-20 13:08:27,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (1/1) ... [2019-09-20 13:08:27,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (1/1) ... [2019-09-20 13:08:27,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (1/1) ... [2019-09-20 13:08:27,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (1/1) ... [2019-09-20 13:08:27,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (1/1) ... [2019-09-20 13:08:27,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:08:27,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:08:27,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:08:27,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:08:27,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:27,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:08:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:08:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:08:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-09-20 13:08:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-09-20 13:08:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-09-20 13:08:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-09-20 13:08:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-09-20 13:08:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-09-20 13:08:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-20 13:08:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:08:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:08:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-20 13:08:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-20 13:08:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-20 13:08:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:08:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:08:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:08:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:08:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:08:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:08:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:08:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:08:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-09-20 13:08:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-09-20 13:08:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-09-20 13:08:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-09-20 13:08:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-09-20 13:08:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-09-20 13:08:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-20 13:08:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:08:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:08:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-20 13:08:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-20 13:08:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-20 13:08:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:08:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:08:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:08:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:08:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:08:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:08:27,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:08:27,727 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:08:27,727 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-20 13:08:27,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:27 BoogieIcfgContainer [2019-09-20 13:08:27,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:08:27,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:08:27,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:08:27,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:08:27,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:08:26" (1/3) ... [2019-09-20 13:08:27,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6194e68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:27, skipping insertion in model container [2019-09-20 13:08:27,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:27" (2/3) ... [2019-09-20 13:08:27,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6194e68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:27, skipping insertion in model container [2019-09-20 13:08:27,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:27" (3/3) ... [2019-09-20 13:08:27,737 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-09-20 13:08:27,745 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:08:27,752 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:08:27,766 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:08:27,799 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:08:27,800 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:08:27,800 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:08:27,800 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:08:27,800 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:08:27,801 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:08:27,801 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:08:27,801 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:08:27,801 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:08:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-09-20 13:08:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:08:27,833 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:27,834 INFO L407 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-09-20 13:08:27,837 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:27,842 INFO L82 PathProgramCache]: Analyzing trace with hash 4101629, now seen corresponding path program 1 times [2019-09-20 13:08:27,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:27,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:27,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:27,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:28,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:28,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:28,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:28,190 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 5 states. [2019-09-20 13:08:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:28,974 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2019-09-20 13:08:28,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:28,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-20 13:08:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:29,007 INFO L225 Difference]: With dead ends: 379 [2019-09-20 13:08:29,007 INFO L226 Difference]: Without dead ends: 252 [2019-09-20 13:08:29,020 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-20 13:08:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2019-09-20 13:08:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-20 13:08:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2019-09-20 13:08:29,175 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2019-09-20 13:08:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:29,176 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2019-09-20 13:08:29,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2019-09-20 13:08:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:08:29,190 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:29,190 INFO L407 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-09-20 13:08:29,190 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1430979773, now seen corresponding path program 1 times [2019-09-20 13:08:29,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:29,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:29,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:29,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:29,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:29,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:29,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:29,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:29,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:29,340 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2019-09-20 13:08:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:30,167 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2019-09-20 13:08:30,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:08:30,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-20 13:08:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:30,173 INFO L225 Difference]: With dead ends: 628 [2019-09-20 13:08:30,173 INFO L226 Difference]: Without dead ends: 422 [2019-09-20 13:08:30,175 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:08:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-20 13:08:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2019-09-20 13:08:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:08:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2019-09-20 13:08:30,239 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2019-09-20 13:08:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:30,240 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2019-09-20 13:08:30,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2019-09-20 13:08:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:08:30,246 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:30,246 INFO L407 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-09-20 13:08:30,247 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:30,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1477202113, now seen corresponding path program 1 times [2019-09-20 13:08:30,254 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:30,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:30,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:30,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:30,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:30,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:30,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:30,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:30,359 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2019-09-20 13:08:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:30,406 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2019-09-20 13:08:30,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:30,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-20 13:08:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:30,410 INFO L225 Difference]: With dead ends: 685 [2019-09-20 13:08:30,410 INFO L226 Difference]: Without dead ends: 369 [2019-09-20 13:08:30,412 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-20 13:08:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2019-09-20 13:08:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 13:08:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2019-09-20 13:08:30,441 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2019-09-20 13:08:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:30,442 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2019-09-20 13:08:30,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2019-09-20 13:08:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:08:30,444 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:30,444 INFO L407 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-09-20 13:08:30,444 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:30,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1229055619, now seen corresponding path program 1 times [2019-09-20 13:08:30,445 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:30,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:30,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:30,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:30,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:30,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:30,542 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2019-09-20 13:08:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:30,740 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2019-09-20 13:08:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:30,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:08:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:30,746 INFO L225 Difference]: With dead ends: 991 [2019-09-20 13:08:30,747 INFO L226 Difference]: Without dead ends: 670 [2019-09-20 13:08:30,748 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-20 13:08:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-09-20 13:08:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-20 13:08:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2019-09-20 13:08:30,794 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2019-09-20 13:08:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:30,794 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2019-09-20 13:08:30,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2019-09-20 13:08:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:08:30,797 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:30,797 INFO L407 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-09-20 13:08:30,797 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash 650743635, now seen corresponding path program 1 times [2019-09-20 13:08:30,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:30,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:30,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:30,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:30,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:30,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:30,867 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2019-09-20 13:08:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:30,944 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2019-09-20 13:08:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:30,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-20 13:08:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:30,949 INFO L225 Difference]: With dead ends: 1280 [2019-09-20 13:08:30,949 INFO L226 Difference]: Without dead ends: 672 [2019-09-20 13:08:30,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-20 13:08:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2019-09-20 13:08:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-20 13:08:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2019-09-20 13:08:30,992 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2019-09-20 13:08:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:30,993 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2019-09-20 13:08:30,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2019-09-20 13:08:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:08:30,995 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:30,995 INFO L407 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-09-20 13:08:30,995 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:30,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:30,996 INFO L82 PathProgramCache]: Analyzing trace with hash 578357077, now seen corresponding path program 1 times [2019-09-20 13:08:30,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:30,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:30,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:31,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:31,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:31,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:31,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:31,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:31,071 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2019-09-20 13:08:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:31,911 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2019-09-20 13:08:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:08:31,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-20 13:08:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:31,918 INFO L225 Difference]: With dead ends: 1359 [2019-09-20 13:08:31,918 INFO L226 Difference]: Without dead ends: 831 [2019-09-20 13:08:31,921 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:08:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-09-20 13:08:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2019-09-20 13:08:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-20 13:08:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2019-09-20 13:08:31,984 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2019-09-20 13:08:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:31,984 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2019-09-20 13:08:31,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2019-09-20 13:08:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:08:31,987 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:31,987 INFO L407 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-09-20 13:08:31,988 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:31,988 INFO L82 PathProgramCache]: Analyzing trace with hash 68883987, now seen corresponding path program 1 times [2019-09-20 13:08:31,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:31,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:31,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:31,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:31,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:32,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:32,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:32,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:32,086 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2019-09-20 13:08:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:32,189 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2019-09-20 13:08:32,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:32,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-20 13:08:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:32,204 INFO L225 Difference]: With dead ends: 1887 [2019-09-20 13:08:32,205 INFO L226 Difference]: Without dead ends: 1276 [2019-09-20 13:08:32,208 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-09-20 13:08:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2019-09-20 13:08:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-20 13:08:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2019-09-20 13:08:32,304 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2019-09-20 13:08:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:32,306 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2019-09-20 13:08:32,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2019-09-20 13:08:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:08:32,311 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:32,311 INFO L407 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-09-20 13:08:32,312 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 173246819, now seen corresponding path program 1 times [2019-09-20 13:08:32,312 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:32,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:32,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:32,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:32,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:32,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:32,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:32,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:32,433 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2019-09-20 13:08:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:32,637 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2019-09-20 13:08:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:08:32,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-20 13:08:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:32,655 INFO L225 Difference]: With dead ends: 3564 [2019-09-20 13:08:32,655 INFO L226 Difference]: Without dead ends: 2309 [2019-09-20 13:08:32,662 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:08:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2019-09-20 13:08:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2019-09-20 13:08:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2019-09-20 13:08:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2019-09-20 13:08:32,841 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2019-09-20 13:08:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:32,842 INFO L475 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2019-09-20 13:08:32,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2019-09-20 13:08:32,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:08:32,845 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:32,845 INFO L407 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-09-20 13:08:32,845 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1970791480, now seen corresponding path program 1 times [2019-09-20 13:08:32,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:32,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:32,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:32,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:32,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:32,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:32,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:32,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:32,907 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2019-09-20 13:08:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:33,673 INFO L93 Difference]: Finished difference Result 6956 states and 9741 transitions. [2019-09-20 13:08:33,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:33,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-20 13:08:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:33,723 INFO L225 Difference]: With dead ends: 6956 [2019-09-20 13:08:33,724 INFO L226 Difference]: Without dead ends: 4830 [2019-09-20 13:08:33,744 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:33,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2019-09-20 13:08:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2019-09-20 13:08:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2019-09-20 13:08:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2019-09-20 13:08:34,181 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2019-09-20 13:08:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:34,183 INFO L475 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2019-09-20 13:08:34,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2019-09-20 13:08:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:08:34,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:34,188 INFO L407 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-09-20 13:08:34,189 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:34,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1829324777, now seen corresponding path program 1 times [2019-09-20 13:08:34,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:34,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:34,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:34,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:34,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:34,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:34,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:34,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:34,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:34,255 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2019-09-20 13:08:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:34,683 INFO L93 Difference]: Finished difference Result 6313 states and 8477 transitions. [2019-09-20 13:08:34,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:34,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:08:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:34,722 INFO L225 Difference]: With dead ends: 6313 [2019-09-20 13:08:34,722 INFO L226 Difference]: Without dead ends: 6310 [2019-09-20 13:08:34,726 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2019-09-20 13:08:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 6141. [2019-09-20 13:08:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2019-09-20 13:08:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 8233 transitions. [2019-09-20 13:08:35,134 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 8233 transitions. Word has length 88 [2019-09-20 13:08:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:35,135 INFO L475 AbstractCegarLoop]: Abstraction has 6141 states and 8233 transitions. [2019-09-20 13:08:35,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 8233 transitions. [2019-09-20 13:08:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:08:35,138 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:35,138 INFO L407 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-09-20 13:08:35,138 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash -797912562, now seen corresponding path program 1 times [2019-09-20 13:08:35,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:35,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:35,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:35,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:08:35,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:35,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:35,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:35,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:35,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:35,178 INFO L87 Difference]: Start difference. First operand 6141 states and 8233 transitions. Second operand 4 states. [2019-09-20 13:08:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:35,550 INFO L93 Difference]: Finished difference Result 11956 states and 16039 transitions. [2019-09-20 13:08:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:35,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:08:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:35,588 INFO L225 Difference]: With dead ends: 11956 [2019-09-20 13:08:35,588 INFO L226 Difference]: Without dead ends: 5872 [2019-09-20 13:08:35,615 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5872 states. [2019-09-20 13:08:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5872 to 5872. [2019-09-20 13:08:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2019-09-20 13:08:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7872 transitions. [2019-09-20 13:08:36,066 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7872 transitions. Word has length 89 [2019-09-20 13:08:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:36,066 INFO L475 AbstractCegarLoop]: Abstraction has 5872 states and 7872 transitions. [2019-09-20 13:08:36,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7872 transitions. [2019-09-20 13:08:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:08:36,068 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:36,068 INFO L407 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-09-20 13:08:36,069 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash -874813360, now seen corresponding path program 1 times [2019-09-20 13:08:36,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:36,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:36,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:36,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:36,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:36,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:36,225 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:36,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:36,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-20 13:08:36,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:08:36,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:08:36,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-20 13:08:36,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:08:36,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:08:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:08:36,640 INFO L87 Difference]: Start difference. First operand 5872 states and 7872 transitions. Second operand 11 states. [2019-09-20 13:08:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:40,361 INFO L93 Difference]: Finished difference Result 15758 states and 23867 transitions. [2019-09-20 13:08:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 13:08:40,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-20 13:08:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:40,467 INFO L225 Difference]: With dead ends: 15758 [2019-09-20 13:08:40,467 INFO L226 Difference]: Without dead ends: 15755 [2019-09-20 13:08:40,475 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:08:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15755 states. [2019-09-20 13:08:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15755 to 15192. [2019-09-20 13:08:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15192 states. [2019-09-20 13:08:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15192 states to 15192 states and 22734 transitions. [2019-09-20 13:08:41,886 INFO L78 Accepts]: Start accepts. Automaton has 15192 states and 22734 transitions. Word has length 89 [2019-09-20 13:08:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:41,886 INFO L475 AbstractCegarLoop]: Abstraction has 15192 states and 22734 transitions. [2019-09-20 13:08:41,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:08:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 15192 states and 22734 transitions. [2019-09-20 13:08:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-20 13:08:41,890 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:41,891 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:41,891 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:41,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1062268553, now seen corresponding path program 2 times [2019-09-20 13:08:41,892 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:41,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:41,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:41,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:41,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:41,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:41,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:41,970 INFO L87 Difference]: Start difference. First operand 15192 states and 22734 transitions. Second operand 3 states. [2019-09-20 13:08:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:43,606 INFO L93 Difference]: Finished difference Result 24841 states and 38821 transitions. [2019-09-20 13:08:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:43,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-20 13:08:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:43,663 INFO L225 Difference]: With dead ends: 24841 [2019-09-20 13:08:43,663 INFO L226 Difference]: Without dead ends: 10372 [2019-09-20 13:08:43,752 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10372 states. [2019-09-20 13:08:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10372 to 10116. [2019-09-20 13:08:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10116 states. [2019-09-20 13:08:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 14383 transitions. [2019-09-20 13:08:44,466 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 14383 transitions. Word has length 92 [2019-09-20 13:08:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:44,467 INFO L475 AbstractCegarLoop]: Abstraction has 10116 states and 14383 transitions. [2019-09-20 13:08:44,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 14383 transitions. [2019-09-20 13:08:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:08:44,469 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:44,470 INFO L407 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, 1, 1, 1] [2019-09-20 13:08:44,470 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash -851936585, now seen corresponding path program 1 times [2019-09-20 13:08:44,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:44,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:44,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:44,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:08:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:08:44,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:44,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:08:44,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:08:44,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:08:44,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:44,569 INFO L87 Difference]: Start difference. First operand 10116 states and 14383 transitions. Second operand 7 states. [2019-09-20 13:08:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:47,096 INFO L93 Difference]: Finished difference Result 35655 states and 58048 transitions. [2019-09-20 13:08:47,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 13:08:47,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-09-20 13:08:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:47,211 INFO L225 Difference]: With dead ends: 35655 [2019-09-20 13:08:47,212 INFO L226 Difference]: Without dead ends: 19845 [2019-09-20 13:08:47,304 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:08:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19845 states. [2019-09-20 13:08:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19845 to 18429. [2019-09-20 13:08:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18429 states. [2019-09-20 13:08:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18429 states to 18429 states and 25148 transitions. [2019-09-20 13:08:49,124 INFO L78 Accepts]: Start accepts. Automaton has 18429 states and 25148 transitions. Word has length 100 [2019-09-20 13:08:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:49,125 INFO L475 AbstractCegarLoop]: Abstraction has 18429 states and 25148 transitions. [2019-09-20 13:08:49,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:08:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 18429 states and 25148 transitions. [2019-09-20 13:08:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:08:49,132 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:49,132 INFO L407 BasicCegarLoop]: trace histogram [3, 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] [2019-09-20 13:08:49,133 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1692518472, now seen corresponding path program 1 times [2019-09-20 13:08:49,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:49,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:49,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:49,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-20 13:08:49,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:49,262 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:49,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:49,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:08:49,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:08:49,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-20 13:08:49,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:08:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:08:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:08:49,543 INFO L87 Difference]: Start difference. First operand 18429 states and 25148 transitions. Second operand 9 states. [2019-09-20 13:08:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:51,980 INFO L93 Difference]: Finished difference Result 32556 states and 45174 transitions. [2019-09-20 13:08:51,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 13:08:51,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-20 13:08:51,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:52,052 INFO L225 Difference]: With dead ends: 32556 [2019-09-20 13:08:52,052 INFO L226 Difference]: Without dead ends: 15096 [2019-09-20 13:08:52,112 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:08:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15096 states. [2019-09-20 13:08:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15096 to 14338. [2019-09-20 13:08:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14338 states. [2019-09-20 13:08:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 17118 transitions. [2019-09-20 13:08:53,887 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 17118 transitions. Word has length 110 [2019-09-20 13:08:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:53,887 INFO L475 AbstractCegarLoop]: Abstraction has 14338 states and 17118 transitions. [2019-09-20 13:08:53,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:08:53,888 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 17118 transitions. [2019-09-20 13:08:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-20 13:08:53,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:53,901 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:53,901 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash -390595365, now seen corresponding path program 1 times [2019-09-20 13:08:53,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:53,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:53,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:53,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:53,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:08:54,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:54,015 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 13:08:54,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-20 13:08:54,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:54,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-20 13:08:54,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:08:54,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:08:54,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:08:54,284 INFO L87 Difference]: Start difference. First operand 14338 states and 17118 transitions. Second operand 8 states. [2019-09-20 13:08:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,517 INFO L93 Difference]: Finished difference Result 31805 states and 38553 transitions. [2019-09-20 13:08:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:08:55,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-09-20 13:08:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted.