./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/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-678e011 [2019-11-19 22:19:39,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:19:39,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:19:39,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:19:39,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:19:39,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:19:39,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:19:39,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:19:39,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:19:39,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:19:39,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:19:39,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:19:39,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:19:39,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:19:39,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:19:39,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:19:39,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:19:39,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:19:39,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:19:39,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:19:39,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:19:39,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:19:39,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:19:39,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:19:39,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:19:39,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:19:39,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:19:39,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:19:39,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:19:39,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:19:39,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:19:39,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:19:39,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:19:39,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:19:39,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:19:39,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:19:39,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:19:39,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:19:39,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:19:39,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:19:39,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:19:39,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:19:39,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:19:39,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:19:39,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:19:39,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:19:39,882 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:19:39,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:19:39,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:19:39,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:19:39,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:19:39,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:19:39,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:19:39,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:19:39,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:19:39,884 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:19:39,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:19:39,884 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:19:39,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:19:39,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:19:39,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:19:39,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:19:39,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:19:39,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:19:39,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:19:39,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:19:39,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:19:39,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:19:39,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:19:39,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:19:39,887 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_354b45bb-5595-4203-9059-e2880c8d1b26/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-19 22:19:40,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:19:40,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:19:40,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:19:40,044 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:19:40,044 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:19:40,045 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2019-11-19 22:19:40,105 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/data/0accbe88a/d2cb2ad05360470ca5b4f17d06c240f3/FLAG4a85caa7a [2019-11-19 22:19:40,553 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:19:40,554 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2019-11-19 22:19:40,567 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/data/0accbe88a/d2cb2ad05360470ca5b4f17d06c240f3/FLAG4a85caa7a [2019-11-19 22:19:40,582 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/data/0accbe88a/d2cb2ad05360470ca5b4f17d06c240f3 [2019-11-19 22:19:40,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:19:40,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:19:40,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:19:40,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:19:40,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:19:40,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:40,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e95bc24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40, skipping insertion in model container [2019-11-19 22:19:40,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:40,601 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:19:40,636 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:19:40,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:19:40,889 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:19:40,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:19:40,942 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:19:40,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40 WrapperNode [2019-11-19 22:19:40,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:19:40,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:19:40,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:19:40,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:19:40,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:40,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:40,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:19:40,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:19:40,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:19:40,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:19:40,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:40,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:40,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:40,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:41,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:41,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:41,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... [2019-11-19 22:19:41,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:19:41,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:19:41,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:19:41,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:19:41,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/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-19 22:19:41,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:19:41,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:19:41,584 INFO L689 $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-19 22:19:41,585 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1 == ~q_free~0); [2019-11-19 22:19:41,586 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:19:41,586 INFO L285 CfgBuilder]: Removed 70 assume(true) statements. [2019-11-19 22:19:41,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:41 BoogieIcfgContainer [2019-11-19 22:19:41,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:19:41,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:19:41,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:19:41,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:19:41,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:19:40" (1/3) ... [2019-11-19 22:19:41,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c70b395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:41, skipping insertion in model container [2019-11-19 22:19:41,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:40" (2/3) ... [2019-11-19 22:19:41,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c70b395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:41, skipping insertion in model container [2019-11-19 22:19:41,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:41" (3/3) ... [2019-11-19 22:19:41,595 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2019-11-19 22:19:41,604 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:19:41,611 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-19 22:19:41,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-19 22:19:41,644 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:19:41,645 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:19:41,645 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:19:41,645 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:19:41,645 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:19:41,646 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:19:41,646 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:19:41,646 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:19:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-19 22:19:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 22:19:41,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:19:41,672 INFO L410 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-19 22:19:41,672 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:19:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:19:41,678 INFO L82 PathProgramCache]: Analyzing trace with hash -660120607, now seen corresponding path program 1 times [2019-11-19 22:19:41,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:19:41,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249037012] [2019-11-19 22:19:41,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:19:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:19:41,852 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-19 22:19:41,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249037012] [2019-11-19 22:19:41,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:19:41,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:19:41,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161690501] [2019-11-19 22:19:41,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:19:41,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:19:41,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:19:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:19:41,875 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-11-19 22:19:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:19:42,004 INFO L93 Difference]: Finished difference Result 377 states and 602 transitions. [2019-11-19 22:19:42,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:19:42,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 22:19:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:19:42,018 INFO L225 Difference]: With dead ends: 377 [2019-11-19 22:19:42,018 INFO L226 Difference]: Without dead ends: 248 [2019-11-19 22:19:42,021 INFO L630 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-19 22:19:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-19 22:19:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2019-11-19 22:19:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-19 22:19:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 372 transitions. [2019-11-19 22:19:42,080 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 372 transitions. Word has length 39 [2019-11-19 22:19:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:19:42,080 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 372 transitions. [2019-11-19 22:19:42,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:19:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 372 transitions. [2019-11-19 22:19:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 22:19:42,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:19:42,083 INFO L410 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-19 22:19:42,083 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:19:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:19:42,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1873516389, now seen corresponding path program 1 times [2019-11-19 22:19:42,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:19:42,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044092614] [2019-11-19 22:19:42,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:19:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:19:42,139 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-19 22:19:42,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044092614] [2019-11-19 22:19:42,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:19:42,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:19:42,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98529353] [2019-11-19 22:19:42,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:19:42,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:19:42,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:19:42,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:19:42,142 INFO L87 Difference]: Start difference. First operand 244 states and 372 transitions. Second operand 3 states. [2019-11-19 22:19:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:19:42,242 INFO L93 Difference]: Finished difference Result 640 states and 969 transitions. [2019-11-19 22:19:42,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:19:42,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 22:19:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:19:42,246 INFO L225 Difference]: With dead ends: 640 [2019-11-19 22:19:42,246 INFO L226 Difference]: Without dead ends: 416 [2019-11-19 22:19:42,248 INFO L630 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-19 22:19:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-19 22:19:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2019-11-19 22:19:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-19 22:19:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2019-11-19 22:19:42,286 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 39 [2019-11-19 22:19:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:19:42,287 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2019-11-19 22:19:42,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:19:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2019-11-19 22:19:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-19 22:19:42,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:19:42,289 INFO L410 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-19 22:19:42,289 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:19:42,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:19:42,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1793155390, now seen corresponding path program 1 times [2019-11-19 22:19:42,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:19:42,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884029066] [2019-11-19 22:19:42,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:19:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:19:42,339 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-19 22:19:42,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884029066] [2019-11-19 22:19:42,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:19:42,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:19:42,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303902850] [2019-11-19 22:19:42,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:19:42,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:19:42,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:19:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:19:42,341 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 3 states. [2019-11-19 22:19:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:19:42,426 INFO L93 Difference]: Finished difference Result 1098 states and 1630 transitions. [2019-11-19 22:19:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:19:42,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-19 22:19:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:19:42,431 INFO L225 Difference]: With dead ends: 1098 [2019-11-19 22:19:42,431 INFO L226 Difference]: Without dead ends: 724 [2019-11-19 22:19:42,433 INFO L630 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-19 22:19:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-19 22:19:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-11-19 22:19:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-19 22:19:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1039 transitions. [2019-11-19 22:19:42,480 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1039 transitions. Word has length 40 [2019-11-19 22:19:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:19:42,481 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1039 transitions. [2019-11-19 22:19:42,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:19:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1039 transitions. [2019-11-19 22:19:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 22:19:42,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:19:42,485 INFO L410 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-19 22:19:42,485 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:19:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:19:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1344512514, now seen corresponding path program 1 times [2019-11-19 22:19:42,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:19:42,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088351836] [2019-11-19 22:19:42,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:19:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:19:42,547 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-19 22:19:42,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088351836] [2019-11-19 22:19:42,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:19:42,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:19:42,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747561474] [2019-11-19 22:19:42,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:19:42,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:19:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:19:42,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:19:42,549 INFO L87 Difference]: Start difference. First operand 716 states and 1039 transitions. Second operand 3 states. [2019-11-19 22:19:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:19:42,642 INFO L93 Difference]: Finished difference Result 2127 states and 3084 transitions. [2019-11-19 22:19:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:19:42,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-19 22:19:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:19:42,651 INFO L225 Difference]: With dead ends: 2127 [2019-11-19 22:19:42,651 INFO L226 Difference]: Without dead ends: 1427 [2019-11-19 22:19:42,652 INFO L630 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-19 22:19:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-11-19 22:19:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1423. [2019-11-19 22:19:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-19 22:19:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2041 transitions. [2019-11-19 22:19:42,708 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2041 transitions. Word has length 53 [2019-11-19 22:19:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:19:42,708 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 2041 transitions. [2019-11-19 22:19:42,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:19:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2041 transitions. [2019-11-19 22:19:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 22:19:42,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:19:42,719 INFO L410 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-19 22:19:42,719 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:19:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:19:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1321880260, now seen corresponding path program 1 times [2019-11-19 22:19:42,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:19:42,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011438058] [2019-11-19 22:19:42,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:19:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:19:42,771 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-19 22:19:42,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011438058] [2019-11-19 22:19:42,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:19:42,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:19:42,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319073975] [2019-11-19 22:19:42,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:19:42,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:19:42,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:19:42,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:19:42,774 INFO L87 Difference]: Start difference. First operand 1423 states and 2041 transitions. Second operand 3 states. [2019-11-19 22:19:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:19:42,896 INFO L93 Difference]: Finished difference Result 4019 states and 5733 transitions. [2019-11-19 22:19:42,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:19:42,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-19 22:19:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:19:42,912 INFO L225 Difference]: With dead ends: 4019 [2019-11-19 22:19:42,912 INFO L226 Difference]: Without dead ends: 2687 [2019-11-19 22:19:42,915 INFO L630 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-19 22:19:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-11-19 22:19:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2683. [2019-11-19 22:19:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2019-11-19 22:19:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3745 transitions. [2019-11-19 22:19:43,028 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3745 transitions. Word has length 53 [2019-11-19 22:19:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:19:43,028 INFO L462 AbstractCegarLoop]: Abstraction has 2683 states and 3745 transitions. [2019-11-19 22:19:43,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:19:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3745 transitions. [2019-11-19 22:19:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 22:19:43,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:19:43,032 INFO L410 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-19 22:19:43,032 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:19:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:19:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 669631146, now seen corresponding path program 1 times [2019-11-19 22:19:43,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:19:43,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747951492] [2019-11-19 22:19:43,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:19:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:19:43,095 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-19 22:19:43,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747951492] [2019-11-19 22:19:43,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:19:43,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:19:43,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918578834] [2019-11-19 22:19:43,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:19:43,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:19:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:19:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:19:43,098 INFO L87 Difference]: Start difference. First operand 2683 states and 3745 transitions. Second operand 3 states. [2019-11-19 22:19:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:19:43,281 INFO L93 Difference]: Finished difference Result 7663 states and 10675 transitions. [2019-11-19 22:19:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:19:43,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-19 22:19:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:19:43,310 INFO L225 Difference]: With dead ends: 7663 [2019-11-19 22:19:43,310 INFO L226 Difference]: Without dead ends: 5147 [2019-11-19 22:19:43,315 INFO L630 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-19 22:19:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2019-11-19 22:19:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 5147. [2019-11-19 22:19:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5147 states. [2019-11-19 22:19:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7065 transitions. [2019-11-19 22:19:43,573 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7065 transitions. Word has length 55 [2019-11-19 22:19:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:19:43,574 INFO L462 AbstractCegarLoop]: Abstraction has 5147 states and 7065 transitions. [2019-11-19 22:19:43,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:19:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7065 transitions. [2019-11-19 22:19:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:19:43,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:19:43,586 INFO L410 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-19 22:19:43,589 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:19:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:19:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1088862051, now seen corresponding path program 1 times [2019-11-19 22:19:43,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:19:43,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142723215] [2019-11-19 22:19:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:19:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:19:43,693 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-19 22:19:43,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142723215] [2019-11-19 22:19:43,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:19:43,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:19:43,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880274157] [2019-11-19 22:19:43,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:19:43,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:19:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:19:43,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:19:43,703 INFO L87 Difference]: Start difference. First operand 5147 states and 7065 transitions. Second operand 3 states. [2019-11-19 22:19:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:19:44,003 INFO L93 Difference]: Finished difference Result 14819 states and 20413 transitions. [2019-11-19 22:19:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:19:44,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-19 22:19:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:19:44,055 INFO L225 Difference]: With dead ends: 14819 [2019-11-19 22:19:44,055 INFO L226 Difference]: Without dead ends: 9983 [2019-11-19 22:19:44,062 INFO L630 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-19 22:19:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-11-19 22:19:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9979. [2019-11-19 22:19:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9979 states. [2019-11-19 22:19:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9979 states to 9979 states and 13609 transitions. [2019-11-19 22:19:44,453 INFO L78 Accepts]: Start accepts. Automaton has 9979 states and 13609 transitions. Word has length 96 [2019-11-19 22:19:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:19:44,453 INFO L462 AbstractCegarLoop]: Abstraction has 9979 states and 13609 transitions. [2019-11-19 22:19:44,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:19:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9979 states and 13609 transitions. [2019-11-19 22:19:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 22:19:44,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:19:44,471 INFO L410 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-19 22:19:44,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:19:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:19:44,472 INFO L82 PathProgramCache]: Analyzing trace with hash 786050006, now seen corresponding path program 1 times [2019-11-19 22:19:44,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:19:44,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527497903] [2019-11-19 22:19:44,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:19:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:19:44,541 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-19 22:19:44,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527497903] [2019-11-19 22:19:44,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:19:44,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:19:44,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235287988] [2019-11-19 22:19:44,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:19:44,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:19:44,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:19:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:19:44,545 INFO L87 Difference]: Start difference. First operand 9979 states and 13609 transitions. Second operand 3 states. [2019-11-19 22:19:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:19:44,939 INFO L93 Difference]: Finished difference Result 14843 states and 20361 transitions. [2019-11-19 22:19:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:19:44,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-19 22:19:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:19:44,941 INFO L225 Difference]: With dead ends: 14843 [2019-11-19 22:19:44,941 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:19:44,953 INFO L630 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-19 22:19:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:19:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:19:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:19:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:19:44,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2019-11-19 22:19:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:19:44,954 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:19:44,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:19:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:19:44,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:19:44,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:19:46,367 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-19 22:19:46,367 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-19 22:19:46,367 INFO L444 ceAbstractionStarter]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2019-11-19 22:19:46,368 INFO L440 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-19 22:19:46,368 INFO L444 ceAbstractionStarter]: For program point L301-2(lines 301 305) no Hoare annotation was computed. [2019-11-19 22:19:46,368 INFO L444 ceAbstractionStarter]: For program point L301-4(lines 300 313) no Hoare annotation was computed. [2019-11-19 22:19:46,368 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 509) no Hoare annotation was computed. [2019-11-19 22:19:46,368 INFO L440 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-19 22:19:46,368 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-19 22:19:46,368 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 151) no Hoare annotation was computed. [2019-11-19 22:19:46,368 INFO L440 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-19 22:19:46,369 INFO L440 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-19 22:19:46,369 INFO L440 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-19 22:19:46,369 INFO L440 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-19 22:19:46,369 INFO L440 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-19 22:19:46,369 INFO L440 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-19 22:19:46,369 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2019-11-19 22:19:46,369 INFO L444 ceAbstractionStarter]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2019-11-19 22:19:46,369 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 346) no Hoare annotation was computed. [2019-11-19 22:19:46,370 INFO L440 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-19 22:19:46,370 INFO L440 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-19 22:19:46,370 INFO L440 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-19 22:19:46,370 INFO L444 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-19 22:19:46,370 INFO L444 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-19 22:19:46,370 INFO L444 ceAbstractionStarter]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2019-11-19 22:19:46,370 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 150) no Hoare annotation was computed. [2019-11-19 22:19:46,371 INFO L447 ceAbstractionStarter]: At program point L10-1(lines 188 242) the Hoare annotation is: true [2019-11-19 22:19:46,371 INFO L440 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-19 22:19:46,371 INFO L440 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-19 22:19:46,371 INFO L440 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-19 22:19:46,371 INFO L440 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-19 22:19:46,371 INFO L440 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-19 22:19:46,371 INFO L440 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-19 22:19:46,372 INFO L440 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-19 22:19:46,372 INFO L440 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-19 22:19:46,372 INFO L440 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-19 22:19:46,372 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 149) no Hoare annotation was computed. [2019-11-19 22:19:46,372 INFO L440 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-19 22:19:46,372 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-11-19 22:19:46,372 INFO L444 ceAbstractionStarter]: For program point L377-2(lines 377 381) no Hoare annotation was computed. [2019-11-19 22:19:46,372 INFO L444 ceAbstractionStarter]: For program point L377-3(lines 377 381) no Hoare annotation was computed. [2019-11-19 22:19:46,373 INFO L444 ceAbstractionStarter]: For program point L377-5(lines 377 381) no Hoare annotation was computed. [2019-11-19 22:19:46,373 INFO L444 ceAbstractionStarter]: For program point L377-6(lines 377 381) no Hoare annotation was computed. [2019-11-19 22:19:46,373 INFO L444 ceAbstractionStarter]: For program point L377-8(lines 377 381) no Hoare annotation was computed. [2019-11-19 22:19:46,373 INFO L444 ceAbstractionStarter]: For program point L281(lines 281 291) no Hoare annotation was computed. [2019-11-19 22:19:46,376 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 254) no Hoare annotation was computed. [2019-11-19 22:19:46,376 INFO L444 ceAbstractionStarter]: For program point L281-1(lines 281 291) no Hoare annotation was computed. [2019-11-19 22:19:46,376 INFO L440 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-19 22:19:46,376 INFO L444 ceAbstractionStarter]: For program point L281-2(lines 281 291) no Hoare annotation was computed. [2019-11-19 22:19:46,377 INFO L444 ceAbstractionStarter]: For program point L248-2(lines 248 254) no Hoare annotation was computed. [2019-11-19 22:19:46,377 INFO L440 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-19 22:19:46,377 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-11-19 22:19:46,377 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 421) no Hoare annotation was computed. [2019-11-19 22:19:46,378 INFO L440 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-19 22:19:46,380 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2019-11-19 22:19:46,380 INFO L444 ceAbstractionStarter]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2019-11-19 22:19:46,380 INFO L444 ceAbstractionStarter]: For program point L85-3(lines 85 94) no Hoare annotation was computed. [2019-11-19 22:19:46,380 INFO L444 ceAbstractionStarter]: For program point L85-5(lines 84 108) no Hoare annotation was computed. [2019-11-19 22:19:46,381 INFO L444 ceAbstractionStarter]: For program point L85-6(lines 85 94) no Hoare annotation was computed. [2019-11-19 22:19:46,381 INFO L444 ceAbstractionStarter]: For program point L85-8(lines 84 108) no Hoare annotation was computed. [2019-11-19 22:19:46,381 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-19 22:19:46,381 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:19:46,381 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-11-19 22:19:46,381 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 86 91) no Hoare annotation was computed. [2019-11-19 22:19:46,382 INFO L444 ceAbstractionStarter]: For program point L86-2(lines 86 91) no Hoare annotation was computed. [2019-11-19 22:19:46,382 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 290) no Hoare annotation was computed. [2019-11-19 22:19:46,383 INFO L444 ceAbstractionStarter]: For program point L285-1(lines 285 290) no Hoare annotation was computed. [2019-11-19 22:19:46,383 INFO L444 ceAbstractionStarter]: For program point L285-2(lines 285 290) no Hoare annotation was computed. [2019-11-19 22:19:46,383 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-11-19 22:19:46,383 INFO L440 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-19 22:19:46,383 INFO L444 ceAbstractionStarter]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2019-11-19 22:19:46,384 INFO L444 ceAbstractionStarter]: For program point L385-3(lines 385 389) no Hoare annotation was computed. [2019-11-19 22:19:46,384 INFO L440 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-19 22:19:46,384 INFO L444 ceAbstractionStarter]: For program point L319-3(lines 318 331) no Hoare annotation was computed. [2019-11-19 22:19:46,384 INFO L444 ceAbstractionStarter]: For program point L385-6(lines 385 389) no Hoare annotation was computed. [2019-11-19 22:19:46,385 INFO L440 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-19 22:19:46,385 INFO L440 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-19 22:19:46,385 INFO L444 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-19 22:19:46,386 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 65) no Hoare annotation was computed. [2019-11-19 22:19:46,386 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2019-11-19 22:19:46,386 INFO L444 ceAbstractionStarter]: For program point L56-3(lines 56 65) no Hoare annotation was computed. [2019-11-19 22:19:46,386 INFO L444 ceAbstractionStarter]: For program point L56-5(lines 55 79) no Hoare annotation was computed. [2019-11-19 22:19:46,386 INFO L444 ceAbstractionStarter]: For program point L56-6(lines 56 65) no Hoare annotation was computed. [2019-11-19 22:19:46,386 INFO L444 ceAbstractionStarter]: For program point L56-8(lines 55 79) no Hoare annotation was computed. [2019-11-19 22:19:46,387 INFO L447 ceAbstractionStarter]: At program point L519(lines 466 524) the Hoare annotation is: true [2019-11-19 22:19:46,387 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 197) no Hoare annotation was computed. [2019-11-19 22:19:46,387 INFO L444 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-11-19 22:19:46,387 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-19 22:19:46,387 INFO L444 ceAbstractionStarter]: For program point L57-2(lines 57 62) no Hoare annotation was computed. [2019-11-19 22:19:46,387 INFO L447 ceAbstractionStarter]: At program point L553(lines 544 555) the Hoare annotation is: true [2019-11-19 22:19:46,388 INFO L444 ceAbstractionStarter]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2019-11-19 22:19:46,388 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:19:46,388 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 460) no Hoare annotation was computed. [2019-11-19 22:19:46,388 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 236) no Hoare annotation was computed. [2019-11-19 22:19:46,388 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2019-11-19 22:19:46,388 INFO L444 ceAbstractionStarter]: For program point L26-2(lines 25 40) no Hoare annotation was computed. [2019-11-19 22:19:46,388 INFO L444 ceAbstractionStarter]: For program point L26-3(lines 26 30) no Hoare annotation was computed. [2019-11-19 22:19:46,389 INFO L444 ceAbstractionStarter]: For program point L26-5(lines 25 40) no Hoare annotation was computed. [2019-11-19 22:19:46,389 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 231) no Hoare annotation was computed. [2019-11-19 22:19:46,389 INFO L440 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-19 22:19:46,389 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 196) no Hoare annotation was computed. [2019-11-19 22:19:46,389 INFO L440 ceAbstractionStarter]: At program point L193(lines 188 242) the Hoare annotation is: false [2019-11-19 22:19:46,390 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:19:46,390 INFO L440 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-19 22:19:46,390 INFO L440 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-19 22:19:46,390 INFO L440 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-19 22:19:46,390 INFO L440 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-19 22:19:46,390 INFO L440 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-19 22:19:46,391 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2019-11-19 22:19:46,391 INFO L444 ceAbstractionStarter]: For program point L95-3(lines 95 104) no Hoare annotation was computed. [2019-11-19 22:19:46,391 INFO L444 ceAbstractionStarter]: For program point L95-5(lines 95 104) no Hoare annotation was computed. [2019-11-19 22:19:46,391 INFO L440 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-19 22:19:46,391 INFO L440 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-19 22:19:46,392 INFO L440 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-19 22:19:46,392 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 101) no Hoare annotation was computed. [2019-11-19 22:19:46,392 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 96 101) no Hoare annotation was computed. [2019-11-19 22:19:46,393 INFO L444 ceAbstractionStarter]: For program point L96-2(lines 96 101) no Hoare annotation was computed. [2019-11-19 22:19:46,393 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2019-11-19 22:19:46,393 INFO L444 ceAbstractionStarter]: For program point L31-3(lines 31 35) no Hoare annotation was computed. [2019-11-19 22:19:46,393 INFO L444 ceAbstractionStarter]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2019-11-19 22:19:46,393 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 22:19:46,393 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-19 22:19:46,394 INFO L440 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-19 22:19:46,394 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 436) no Hoare annotation was computed. [2019-11-19 22:19:46,394 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2019-11-19 22:19:46,394 INFO L444 ceAbstractionStarter]: For program point L66-3(lines 66 75) no Hoare annotation was computed. [2019-11-19 22:19:46,394 INFO L444 ceAbstractionStarter]: For program point L66-5(lines 66 75) no Hoare annotation was computed. [2019-11-19 22:19:46,394 INFO L440 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-19 22:19:46,395 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 72) no Hoare annotation was computed. [2019-11-19 22:19:46,395 INFO L444 ceAbstractionStarter]: For program point L67-1(lines 67 72) no Hoare annotation was computed. [2019-11-19 22:19:46,395 INFO L444 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2019-11-19 22:19:46,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:19:46 BoogieIcfgContainer [2019-11-19 22:19:46,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:19:46,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:19:46,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:19:46,436 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:19:46,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:41" (3/4) ... [2019-11-19 22:19:46,439 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:19:46,463 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 22:19:46,464 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:19:46,613 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_354b45bb-5595-4203-9059-e2880c8d1b26/bin/uautomizer/witness.graphml [2019-11-19 22:19:46,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:19:46,615 INFO L168 Benchmark]: Toolchain (without parser) took 6028.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 944.7 MB in the beginning and 818.8 MB in the end (delta: 125.9 MB). Peak memory consumption was 457.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:19:46,616 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:19:46,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:19:46,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.31 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:19:46,619 INFO L168 Benchmark]: Boogie Preprocessor took 31.37 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-19 22:19:46,620 INFO L168 Benchmark]: RCFGBuilder took 569.37 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:19:46,620 INFO L168 Benchmark]: TraceAbstraction took 4846.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 830.2 MB in the end (delta: 261.0 MB). Peak memory consumption was 440.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:19:46,621 INFO L168 Benchmark]: Witness Printer took 178.02 ms. Allocated memory is still 1.4 GB. Free memory was 830.2 MB in the beginning and 818.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:19:46,622 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.31 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.37 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 569.37 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4846.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 830.2 MB in the end (delta: 261.0 MB). Peak memory consumption was 440.9 MB. Max. memory is 11.5 GB. * Witness Printer took 178.02 ms. Allocated memory is still 1.4 GB. Free memory was 830.2 MB in the beginning and 818.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 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: 4.7s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, 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: 0.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 43 PreInvPairs, 3777 NumberOfFragments, 316 HoareAnnotationTreeSize, 43 FomulaSimplifications, 47557 FormulaSimplificationTreeSizeReduction, 1.1s 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...