./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:18:11,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:18:11,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:18:11,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:18:11,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:18:11,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:18:11,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:18:11,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:18:11,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:18:11,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:18:11,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:18:11,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:18:11,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:18:11,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:18:11,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:18:11,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:18:11,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:18:11,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:18:11,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:18:11,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:18:11,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:18:11,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:18:11,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:18:11,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:18:11,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:18:11,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:18:11,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:18:11,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:18:11,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:18:11,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:18:11,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:18:11,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:18:11,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:18:11,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:18:11,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:18:11,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:18:11,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:18:11,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:18:11,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:18:11,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:18:11,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:18:11,565 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:18:11,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:18:11,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:18:11,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:18:11,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:18:11,583 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:18:11,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:18:11,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:18:11,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:18:11,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:18:11,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:18:11,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:18:11,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:18:11,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:18:11,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:18:11,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:18:11,586 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:18:11,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:18:11,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:18:11,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:18:11,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:18:11,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:18:11,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:18:11,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:18:11,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:18:11,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:18:11,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:18:11,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:18:11,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:18:11,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d [2019-11-16 00:18:11,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:18:11,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:18:11,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:18:11,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:18:11,643 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:18:11,644 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2019-11-16 00:18:11,726 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/data/c51d6b780/555adee661f94dc185b1f37c330f5a63/FLAG7bc9c5495 [2019-11-16 00:18:12,184 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:18:12,185 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2019-11-16 00:18:12,196 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/data/c51d6b780/555adee661f94dc185b1f37c330f5a63/FLAG7bc9c5495 [2019-11-16 00:18:12,534 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/data/c51d6b780/555adee661f94dc185b1f37c330f5a63 [2019-11-16 00:18:12,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:18:12,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:18:12,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:18:12,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:18:12,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:18:12,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:12" (1/1) ... [2019-11-16 00:18:12,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3f706d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:12, skipping insertion in model container [2019-11-16 00:18:12,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:12" (1/1) ... [2019-11-16 00:18:12,553 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:18:12,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:18:12,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:18:12,920 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:18:12,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:18:13,012 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:18:13,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13 WrapperNode [2019-11-16 00:18:13,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:18:13,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:18:13,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:18:13,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:18:13,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:18:13,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:18:13,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:18:13,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:18:13,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... [2019-11-16 00:18:13,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:18:13,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:18:13,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:18:13,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:18:13,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/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-11-16 00:18:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:18:13,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:18:14,002 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0; [2019-11-16 00:18:14,002 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1 == ~q_free~0); [2019-11-16 00:18:14,005 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:18:14,006 INFO L284 CfgBuilder]: Removed 70 assume(true) statements. [2019-11-16 00:18:14,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:14 BoogieIcfgContainer [2019-11-16 00:18:14,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:18:14,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:18:14,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:18:14,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:18:14,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:18:12" (1/3) ... [2019-11-16 00:18:14,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105e8baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:14, skipping insertion in model container [2019-11-16 00:18:14,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:13" (2/3) ... [2019-11-16 00:18:14,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105e8baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:14, skipping insertion in model container [2019-11-16 00:18:14,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:14" (3/3) ... [2019-11-16 00:18:14,022 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2019-11-16 00:18:14,033 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:18:14,044 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-16 00:18:14,055 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-16 00:18:14,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:18:14,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:18:14,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:18:14,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:18:14,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:18:14,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:18:14,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:18:14,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:18:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-16 00:18:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:18:14,135 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:14,135 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:14,139 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -660120607, now seen corresponding path program 1 times [2019-11-16 00:18:14,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:14,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122951331] [2019-11-16 00:18:14,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:14,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:14,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:14,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122951331] [2019-11-16 00:18:14,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:14,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:14,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896738251] [2019-11-16 00:18:14,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:14,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:14,334 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-11-16 00:18:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:14,458 INFO L93 Difference]: Finished difference Result 377 states and 602 transitions. [2019-11-16 00:18:14,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:14,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-16 00:18:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:14,473 INFO L225 Difference]: With dead ends: 377 [2019-11-16 00:18:14,473 INFO L226 Difference]: Without dead ends: 248 [2019-11-16 00:18:14,476 INFO L600 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-11-16 00:18:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-16 00:18:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2019-11-16 00:18:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-16 00:18:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 372 transitions. [2019-11-16 00:18:14,562 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 372 transitions. Word has length 39 [2019-11-16 00:18:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:14,562 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 372 transitions. [2019-11-16 00:18:14,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 372 transitions. [2019-11-16 00:18:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:18:14,565 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:14,565 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:14,565 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:14,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1873516389, now seen corresponding path program 1 times [2019-11-16 00:18:14,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:14,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628141744] [2019-11-16 00:18:14,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:14,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:14,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:14,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628141744] [2019-11-16 00:18:14,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:14,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:14,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018881072] [2019-11-16 00:18:14,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:14,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:14,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:14,611 INFO L87 Difference]: Start difference. First operand 244 states and 372 transitions. Second operand 3 states. [2019-11-16 00:18:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:14,708 INFO L93 Difference]: Finished difference Result 640 states and 969 transitions. [2019-11-16 00:18:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:14,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-16 00:18:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:14,712 INFO L225 Difference]: With dead ends: 640 [2019-11-16 00:18:14,712 INFO L226 Difference]: Without dead ends: 416 [2019-11-16 00:18:14,715 INFO L600 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-11-16 00:18:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-16 00:18:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2019-11-16 00:18:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-16 00:18:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2019-11-16 00:18:14,753 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 39 [2019-11-16 00:18:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:14,753 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2019-11-16 00:18:14,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2019-11-16 00:18:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:18:14,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:14,756 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:14,756 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1793155390, now seen corresponding path program 1 times [2019-11-16 00:18:14,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:14,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701399021] [2019-11-16 00:18:14,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:14,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:14,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:14,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701399021] [2019-11-16 00:18:14,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:14,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:14,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111509849] [2019-11-16 00:18:14,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:14,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:14,817 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 3 states. [2019-11-16 00:18:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:14,896 INFO L93 Difference]: Finished difference Result 1098 states and 1630 transitions. [2019-11-16 00:18:14,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:14,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-16 00:18:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:14,901 INFO L225 Difference]: With dead ends: 1098 [2019-11-16 00:18:14,901 INFO L226 Difference]: Without dead ends: 724 [2019-11-16 00:18:14,904 INFO L600 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-11-16 00:18:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-16 00:18:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-11-16 00:18:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-16 00:18:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1039 transitions. [2019-11-16 00:18:14,965 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1039 transitions. Word has length 40 [2019-11-16 00:18:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:14,966 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1039 transitions. [2019-11-16 00:18:14,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1039 transitions. [2019-11-16 00:18:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:18:14,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:14,970 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:18:14,970 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1344512514, now seen corresponding path program 1 times [2019-11-16 00:18:14,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:14,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066747075] [2019-11-16 00:18:14,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:14,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:14,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:18:15,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066747075] [2019-11-16 00:18:15,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:15,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:15,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846546705] [2019-11-16 00:18:15,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:15,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:15,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:15,037 INFO L87 Difference]: Start difference. First operand 716 states and 1039 transitions. Second operand 3 states. [2019-11-16 00:18:15,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:15,130 INFO L93 Difference]: Finished difference Result 2127 states and 3084 transitions. [2019-11-16 00:18:15,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:15,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-16 00:18:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:15,139 INFO L225 Difference]: With dead ends: 2127 [2019-11-16 00:18:15,140 INFO L226 Difference]: Without dead ends: 1427 [2019-11-16 00:18:15,141 INFO L600 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-11-16 00:18:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-11-16 00:18:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1423. [2019-11-16 00:18:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-16 00:18:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2041 transitions. [2019-11-16 00:18:15,203 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2041 transitions. Word has length 53 [2019-11-16 00:18:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:15,204 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 2041 transitions. [2019-11-16 00:18:15,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2041 transitions. [2019-11-16 00:18:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:18:15,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:15,207 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:18:15,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1321880260, now seen corresponding path program 1 times [2019-11-16 00:18:15,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:15,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212562330] [2019-11-16 00:18:15,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:15,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:15,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:18:15,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212562330] [2019-11-16 00:18:15,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:15,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:15,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547482489] [2019-11-16 00:18:15,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:15,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:15,259 INFO L87 Difference]: Start difference. First operand 1423 states and 2041 transitions. Second operand 3 states. [2019-11-16 00:18:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:15,391 INFO L93 Difference]: Finished difference Result 4019 states and 5733 transitions. [2019-11-16 00:18:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:15,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-16 00:18:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:15,406 INFO L225 Difference]: With dead ends: 4019 [2019-11-16 00:18:15,407 INFO L226 Difference]: Without dead ends: 2687 [2019-11-16 00:18:15,409 INFO L600 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-11-16 00:18:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-11-16 00:18:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2683. [2019-11-16 00:18:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2019-11-16 00:18:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3745 transitions. [2019-11-16 00:18:15,529 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3745 transitions. Word has length 53 [2019-11-16 00:18:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:15,529 INFO L462 AbstractCegarLoop]: Abstraction has 2683 states and 3745 transitions. [2019-11-16 00:18:15,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3745 transitions. [2019-11-16 00:18:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:18:15,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:15,533 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:18:15,533 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash 669631146, now seen corresponding path program 1 times [2019-11-16 00:18:15,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:15,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555605834] [2019-11-16 00:18:15,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:15,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:15,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:15,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555605834] [2019-11-16 00:18:15,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:15,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:15,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439293277] [2019-11-16 00:18:15,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:15,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:15,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:15,649 INFO L87 Difference]: Start difference. First operand 2683 states and 3745 transitions. Second operand 3 states. [2019-11-16 00:18:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:15,840 INFO L93 Difference]: Finished difference Result 7663 states and 10675 transitions. [2019-11-16 00:18:15,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:15,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-16 00:18:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:15,873 INFO L225 Difference]: With dead ends: 7663 [2019-11-16 00:18:15,874 INFO L226 Difference]: Without dead ends: 5147 [2019-11-16 00:18:15,879 INFO L600 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-11-16 00:18:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2019-11-16 00:18:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 5147. [2019-11-16 00:18:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5147 states. [2019-11-16 00:18:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7065 transitions. [2019-11-16 00:18:16,108 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7065 transitions. Word has length 55 [2019-11-16 00:18:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:16,111 INFO L462 AbstractCegarLoop]: Abstraction has 5147 states and 7065 transitions. [2019-11-16 00:18:16,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7065 transitions. [2019-11-16 00:18:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:18:16,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:16,125 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:16,134 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:16,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1088862051, now seen corresponding path program 1 times [2019-11-16 00:18:16,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:16,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968455284] [2019-11-16 00:18:16,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:16,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:16,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:18:16,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968455284] [2019-11-16 00:18:16,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:16,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:16,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545869221] [2019-11-16 00:18:16,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:16,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:16,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:16,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:16,239 INFO L87 Difference]: Start difference. First operand 5147 states and 7065 transitions. Second operand 3 states. [2019-11-16 00:18:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:16,578 INFO L93 Difference]: Finished difference Result 14819 states and 20413 transitions. [2019-11-16 00:18:16,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:16,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-16 00:18:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:16,638 INFO L225 Difference]: With dead ends: 14819 [2019-11-16 00:18:16,638 INFO L226 Difference]: Without dead ends: 9983 [2019-11-16 00:18:16,648 INFO L600 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-11-16 00:18:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-11-16 00:18:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9979. [2019-11-16 00:18:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9979 states. [2019-11-16 00:18:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9979 states to 9979 states and 13609 transitions. [2019-11-16 00:18:17,149 INFO L78 Accepts]: Start accepts. Automaton has 9979 states and 13609 transitions. Word has length 96 [2019-11-16 00:18:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:17,149 INFO L462 AbstractCegarLoop]: Abstraction has 9979 states and 13609 transitions. [2019-11-16 00:18:17,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 9979 states and 13609 transitions. [2019-11-16 00:18:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:18:17,166 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:17,166 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-16 00:18:17,166 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash 786050006, now seen corresponding path program 1 times [2019-11-16 00:18:17,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:17,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701907465] [2019-11-16 00:18:17,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:17,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:17,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:17,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701907465] [2019-11-16 00:18:17,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:17,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:17,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228861871] [2019-11-16 00:18:17,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:17,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:17,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:17,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:17,239 INFO L87 Difference]: Start difference. First operand 9979 states and 13609 transitions. Second operand 3 states. [2019-11-16 00:18:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:17,561 INFO L93 Difference]: Finished difference Result 14843 states and 20361 transitions. [2019-11-16 00:18:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:17,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-16 00:18:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:17,563 INFO L225 Difference]: With dead ends: 14843 [2019-11-16 00:18:17,563 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:18:17,579 INFO L600 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-11-16 00:18:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:18:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:18:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:18:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:18:17,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2019-11-16 00:18:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:17,580 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:18:17,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:18:17,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:18:17,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:18:17,699 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 6 [2019-11-16 00:18:17,977 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 6 [2019-11-16 00:18:19,207 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-16 00:18:19,207 INFO L443 ceAbstractionStarter]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2019-11-16 00:18:19,208 INFO L439 ceAbstractionStarter]: At program point L268-1(lines 301 305) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,208 INFO L443 ceAbstractionStarter]: For program point L301-2(lines 301 305) no Hoare annotation was computed. [2019-11-16 00:18:19,208 INFO L443 ceAbstractionStarter]: For program point L301-4(lines 300 313) no Hoare annotation was computed. [2019-11-16 00:18:19,208 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 509) no Hoare annotation was computed. [2019-11-16 00:18:19,208 INFO L439 ceAbstractionStarter]: At program point L500-1(lines 500 509) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,208 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-16 00:18:19,208 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 151) no Hoare annotation was computed. [2019-11-16 00:18:19,208 INFO L439 ceAbstractionStarter]: At program point L106(lines 84 108) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,209 INFO L439 ceAbstractionStarter]: At program point L106-1(lines 84 108) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,209 INFO L439 ceAbstractionStarter]: At program point L106-2(lines 84 108) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,209 INFO L439 ceAbstractionStarter]: At program point L107(lines 81 109) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,209 INFO L439 ceAbstractionStarter]: At program point L107-1(lines 81 109) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,209 INFO L439 ceAbstractionStarter]: At program point L107-2(lines 81 109) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,209 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2019-11-16 00:18:19,210 INFO L443 ceAbstractionStarter]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2019-11-16 00:18:19,210 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 346) no Hoare annotation was computed. [2019-11-16 00:18:19,210 INFO L439 ceAbstractionStarter]: At program point L306-1(lines 297 314) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,210 INFO L439 ceAbstractionStarter]: At program point L339-2(lines 335 350) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,210 INFO L439 ceAbstractionStarter]: At program point L306-3(lines 297 314) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,210 INFO L443 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-16 00:18:19,210 INFO L443 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-16 00:18:19,210 INFO L443 ceAbstractionStarter]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2019-11-16 00:18:19,210 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 150) no Hoare annotation was computed. [2019-11-16 00:18:19,211 INFO L446 ceAbstractionStarter]: At program point L10-1(lines 188 242) the Hoare annotation is: true [2019-11-16 00:18:19,211 INFO L439 ceAbstractionStarter]: At program point L143(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,211 INFO L439 ceAbstractionStarter]: At program point L77(lines 55 79) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,211 INFO L439 ceAbstractionStarter]: At program point L77-1(lines 55 79) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,211 INFO L439 ceAbstractionStarter]: At program point L77-2(lines 55 79) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,211 INFO L439 ceAbstractionStarter]: At program point L441(lines 394 446) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,212 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-16 00:18:19,212 INFO L439 ceAbstractionStarter]: At program point L78(lines 52 80) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,212 INFO L439 ceAbstractionStarter]: At program point L78-1(lines 52 80) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,212 INFO L439 ceAbstractionStarter]: At program point L78-2(lines 52 80) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,212 INFO L439 ceAbstractionStarter]: At program point L541(lines 525 543) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= 2 ~q_write_ev~0) (<= 2 ~q_read_ev~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,212 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 149) no Hoare annotation was computed. [2019-11-16 00:18:19,212 INFO L439 ceAbstractionStarter]: At program point L410(lines 400 440) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,212 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L443 ceAbstractionStarter]: For program point L377-2(lines 377 381) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L443 ceAbstractionStarter]: For program point L377-3(lines 377 381) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L443 ceAbstractionStarter]: For program point L377-5(lines 377 381) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L443 ceAbstractionStarter]: For program point L377-6(lines 377 381) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L443 ceAbstractionStarter]: For program point L377-8(lines 377 381) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 291) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 254) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L443 ceAbstractionStarter]: For program point L281-1(lines 281 291) no Hoare annotation was computed. [2019-11-16 00:18:19,213 INFO L439 ceAbstractionStarter]: At program point L248-1(lines 263 267) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,215 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-16 00:18:19,215 INFO L443 ceAbstractionStarter]: For program point L281-2(lines 281 291) no Hoare annotation was computed. [2019-11-16 00:18:19,215 INFO L443 ceAbstractionStarter]: For program point L248-2(lines 248 254) no Hoare annotation was computed. [2019-11-16 00:18:19,215 INFO L439 ceAbstractionStarter]: At program point L248-3(lines 244 258) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,215 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-11-16 00:18:19,215 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 421) no Hoare annotation was computed. [2019-11-16 00:18:19,216 INFO L439 ceAbstractionStarter]: At program point L481-1(lines 315 518) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,216 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2019-11-16 00:18:19,216 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2019-11-16 00:18:19,216 INFO L443 ceAbstractionStarter]: For program point L85-3(lines 85 94) no Hoare annotation was computed. [2019-11-16 00:18:19,216 INFO L443 ceAbstractionStarter]: For program point L85-5(lines 84 108) no Hoare annotation was computed. [2019-11-16 00:18:19,216 INFO L443 ceAbstractionStarter]: For program point L85-6(lines 85 94) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point L85-8(lines 84 108) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 86 91) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 86 91) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 290) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point L285-1(lines 285 290) no Hoare annotation was computed. [2019-11-16 00:18:19,217 INFO L443 ceAbstractionStarter]: For program point L285-2(lines 285 290) no Hoare annotation was computed. [2019-11-16 00:18:19,218 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-11-16 00:18:19,218 INFO L439 ceAbstractionStarter]: At program point L385-2(lines 319 323) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-16 00:18:19,218 INFO L443 ceAbstractionStarter]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2019-11-16 00:18:19,218 INFO L443 ceAbstractionStarter]: For program point L385-3(lines 385 389) no Hoare annotation was computed. [2019-11-16 00:18:19,218 INFO L439 ceAbstractionStarter]: At program point L385-5(lines 319 323) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,218 INFO L443 ceAbstractionStarter]: For program point L319-3(lines 318 331) no Hoare annotation was computed. [2019-11-16 00:18:19,218 INFO L443 ceAbstractionStarter]: For program point L385-6(lines 385 389) no Hoare annotation was computed. [2019-11-16 00:18:19,218 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,219 INFO L439 ceAbstractionStarter]: At program point L385-8(lines 355 359) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,219 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-16 00:18:19,219 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 65) no Hoare annotation was computed. [2019-11-16 00:18:19,219 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2019-11-16 00:18:19,219 INFO L443 ceAbstractionStarter]: For program point L56-3(lines 56 65) no Hoare annotation was computed. [2019-11-16 00:18:19,219 INFO L443 ceAbstractionStarter]: For program point L56-5(lines 55 79) no Hoare annotation was computed. [2019-11-16 00:18:19,219 INFO L443 ceAbstractionStarter]: For program point L56-6(lines 56 65) no Hoare annotation was computed. [2019-11-16 00:18:19,220 INFO L443 ceAbstractionStarter]: For program point L56-8(lines 55 79) no Hoare annotation was computed. [2019-11-16 00:18:19,220 INFO L446 ceAbstractionStarter]: At program point L519(lines 466 524) the Hoare annotation is: true [2019-11-16 00:18:19,220 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 197) no Hoare annotation was computed. [2019-11-16 00:18:19,220 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-11-16 00:18:19,220 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-16 00:18:19,220 INFO L443 ceAbstractionStarter]: For program point L57-2(lines 57 62) no Hoare annotation was computed. [2019-11-16 00:18:19,221 INFO L446 ceAbstractionStarter]: At program point L553(lines 544 555) the Hoare annotation is: true [2019-11-16 00:18:19,221 INFO L443 ceAbstractionStarter]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2019-11-16 00:18:19,221 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:18:19,221 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 460) no Hoare annotation was computed. [2019-11-16 00:18:19,221 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 236) no Hoare annotation was computed. [2019-11-16 00:18:19,221 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2019-11-16 00:18:19,221 INFO L443 ceAbstractionStarter]: For program point L26-2(lines 25 40) no Hoare annotation was computed. [2019-11-16 00:18:19,222 INFO L443 ceAbstractionStarter]: For program point L26-3(lines 26 30) no Hoare annotation was computed. [2019-11-16 00:18:19,222 INFO L443 ceAbstractionStarter]: For program point L26-5(lines 25 40) no Hoare annotation was computed. [2019-11-16 00:18:19,222 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 231) no Hoare annotation was computed. [2019-11-16 00:18:19,222 INFO L439 ceAbstractionStarter]: At program point L324-3(lines 315 332) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,222 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 196) no Hoare annotation was computed. [2019-11-16 00:18:19,222 INFO L439 ceAbstractionStarter]: At program point L193(lines 188 242) the Hoare annotation is: false [2019-11-16 00:18:19,223 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:18:19,223 INFO L439 ceAbstractionStarter]: At program point L425(lines 400 440) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,223 INFO L439 ceAbstractionStarter]: At program point L293(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,223 INFO L439 ceAbstractionStarter]: At program point L293-1(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,223 INFO L439 ceAbstractionStarter]: At program point L293-2(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,223 INFO L439 ceAbstractionStarter]: At program point L161(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,224 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2019-11-16 00:18:19,224 INFO L443 ceAbstractionStarter]: For program point L95-3(lines 95 104) no Hoare annotation was computed. [2019-11-16 00:18:19,224 INFO L443 ceAbstractionStarter]: For program point L95-5(lines 95 104) no Hoare annotation was computed. [2019-11-16 00:18:19,224 INFO L439 ceAbstractionStarter]: At program point L294(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,224 INFO L439 ceAbstractionStarter]: At program point L294-1(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,224 INFO L439 ceAbstractionStarter]: At program point L294-2(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,225 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 101) no Hoare annotation was computed. [2019-11-16 00:18:19,225 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 96 101) no Hoare annotation was computed. [2019-11-16 00:18:19,225 INFO L443 ceAbstractionStarter]: For program point L96-2(lines 96 101) no Hoare annotation was computed. [2019-11-16 00:18:19,225 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2019-11-16 00:18:19,225 INFO L443 ceAbstractionStarter]: For program point L31-3(lines 31 35) no Hoare annotation was computed. [2019-11-16 00:18:19,225 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2019-11-16 00:18:19,225 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:18:19,226 INFO L439 ceAbstractionStarter]: At program point L462(lines 451 464) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,226 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 436) no Hoare annotation was computed. [2019-11-16 00:18:19,226 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2019-11-16 00:18:19,226 INFO L443 ceAbstractionStarter]: For program point L66-3(lines 66 75) no Hoare annotation was computed. [2019-11-16 00:18:19,226 INFO L443 ceAbstractionStarter]: For program point L66-5(lines 66 75) no Hoare annotation was computed. [2019-11-16 00:18:19,226 INFO L439 ceAbstractionStarter]: At program point L463(lines 447 465) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-16 00:18:19,227 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 72) no Hoare annotation was computed. [2019-11-16 00:18:19,227 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 67 72) no Hoare annotation was computed. [2019-11-16 00:18:19,227 INFO L443 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2019-11-16 00:18:19,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:18:19 BoogieIcfgContainer [2019-11-16 00:18:19,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:18:19,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:18:19,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:18:19,269 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:18:19,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:14" (3/4) ... [2019-11-16 00:18:19,274 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:18:19,304 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:18:19,305 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:18:19,469 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d7284253-5094-4518-b402-eecd5c0b71ff/bin/uautomizer/witness.graphml [2019-11-16 00:18:19,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:18:19,470 INFO L168 Benchmark]: Toolchain (without parser) took 6933.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -295.7 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:19,471 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:18:19,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:19,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:19,472 INFO L168 Benchmark]: Boogie Preprocessor took 43.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:18:19,475 INFO L168 Benchmark]: RCFGBuilder took 889.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:19,476 INFO L168 Benchmark]: TraceAbstraction took 5256.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.0 MB). Peak memory consumption was 287.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:19,476 INFO L168 Benchmark]: Witness Printer took 200.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:18:19,479 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 475.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 889.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5256.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.0 MB). Peak memory consumption was 287.8 MB. Max. memory is 11.5 GB. * Witness Printer took 200.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: ((((p_dw_pc <= 0 && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 466]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((p_dw_pc <= 0 && 0 == p_dw_st) && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 544]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 2 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 1693 SDtfs, 1151 SDslu, 1210 SDs, 0 SdLazy, 147 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9979occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 43 PreInvPairs, 3777 NumberOfFragments, 316 HoareAnnotationTreeSize, 43 FomulaSimplifications, 47557 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 43 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 53124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 81/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...