./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak --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 Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 135d8703ed0e2c3b82e17a2ab2579540cc3a8330 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-02 01:50:17,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 01:50:17,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 01:50:17,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 01:50:17,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 01:50:17,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 01:50:17,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 01:50:17,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 01:50:17,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 01:50:17,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 01:50:17,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 01:50:17,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 01:50:17,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 01:50:17,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 01:50:17,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 01:50:17,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 01:50:17,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 01:50:17,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 01:50:17,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 01:50:17,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 01:50:17,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 01:50:17,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 01:50:17,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 01:50:17,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 01:50:17,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 01:50:17,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 01:50:17,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 01:50:17,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 01:50:17,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 01:50:17,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 01:50:17,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 01:50:17,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 01:50:17,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 01:50:17,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 01:50:17,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 01:50:17,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 01:50:17,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 01:50:17,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 01:50:17,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 01:50:17,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 01:50:17,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 01:50:17,152 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf [2019-12-02 01:50:17,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 01:50:17,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 01:50:17,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 01:50:17,163 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 01:50:17,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 01:50:17,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 01:50:17,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 01:50:17,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 01:50:17,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 01:50:17,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 01:50:17,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 01:50:17,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 01:50:17,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 01:50:17,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 01:50:17,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 01:50:17,165 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 01:50:17,165 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 01:50:17,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 01:50:17,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 01:50:17,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 01:50:17,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 01:50:17,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 01:50:17,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 01:50:17,166 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 01:50:17,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 01:50:17,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 01:50:17,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-02 01:50:17,167 INFO L138 SettingsManager]: * To the following directory=dump/ 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_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak 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 -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 135d8703ed0e2c3b82e17a2ab2579540cc3a8330 [2019-12-02 01:50:17,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 01:50:17,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 01:50:17,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 01:50:17,289 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 01:50:17,289 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 01:50:17,290 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-12-02 01:50:17,330 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/data/b97e3ba8d/a10712b03fa5492db4e12105b0c08f6c/FLAG8c4671911 [2019-12-02 01:50:17,780 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 01:50:17,781 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-12-02 01:50:17,797 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/data/b97e3ba8d/a10712b03fa5492db4e12105b0c08f6c/FLAG8c4671911 [2019-12-02 01:50:17,807 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/data/b97e3ba8d/a10712b03fa5492db4e12105b0c08f6c [2019-12-02 01:50:17,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 01:50:17,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 01:50:17,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 01:50:17,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 01:50:17,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 01:50:17,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:50:17" (1/1) ... [2019-12-02 01:50:17,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5029a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:17, skipping insertion in model container [2019-12-02 01:50:17,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:50:17" (1/1) ... [2019-12-02 01:50:17,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 01:50:17,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 01:50:18,302 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-02 01:50:18,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 01:50:18,326 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 01:50:18,413 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-02 01:50:18,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 01:50:18,450 INFO L208 MainTranslator]: Completed translation [2019-12-02 01:50:18,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18 WrapperNode [2019-12-02 01:50:18,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 01:50:18,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 01:50:18,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 01:50:18,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 01:50:18,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 01:50:18,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 01:50:18,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 01:50:18,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 01:50:18,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... [2019-12-02 01:50:18,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 01:50:18,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 01:50:18,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 01:50:18,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 01:50:18,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:50:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-12-02 01:50:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2019-12-02 01:50:18,612 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2019-12-02 01:50:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-12-02 01:50:18,612 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-12-02 01:50:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-02 01:50:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-02 01:50:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-12-02 01:50:18,613 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-12-02 01:50:18,613 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2019-12-02 01:50:18,613 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2019-12-02 01:50:18,613 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-12-02 01:50:18,613 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-12-02 01:50:18,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-02 01:50:18,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-02 01:50:18,613 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-12-02 01:50:18,613 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-12-02 01:50:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-02 01:50:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-12-02 01:50:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-12-02 01:50:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-02 01:50:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-12-02 01:50:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-12-02 01:50:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-02 01:50:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-02 01:50:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-12-02 01:50:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-02 01:50:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-12-02 01:50:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-12-02 01:50:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-12-02 01:50:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-12-02 01:50:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-12-02 01:50:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-12-02 01:50:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-12-02 01:50:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-12-02 01:50:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-02 01:50:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 01:50:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 01:50:18,906 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-12-02 01:50:18,922 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-02 01:50:19,333 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-12-02 01:50:19,333 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-12-02 01:50:23,895 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 01:50:23,895 INFO L287 CfgBuilder]: Removed 57 assume(true) statements. [2019-12-02 01:50:23,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:23 BoogieIcfgContainer [2019-12-02 01:50:23,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 01:50:23,896 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 01:50:23,896 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 01:50:23,902 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 01:50:23,903 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:23" (1/1) ... [2019-12-02 01:50:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 01:50:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 108 states and 145 transitions. [2019-12-02 01:50:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2019-12-02 01:50:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-02 01:50:23,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 01:50:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 108 states and 141 transitions. [2019-12-02 01:50:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2019-12-02 01:50:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-02 01:50:24,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 01:50:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 110 states and 143 transitions. [2019-12-02 01:50:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2019-12-02 01:50:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-02 01:50:24,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 01:50:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 110 states and 142 transitions. [2019-12-02 01:50:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2019-12-02 01:50:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-02 01:50:24,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 01:50:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 114 states and 154 transitions. [2019-12-02 01:50:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2019-12-02 01:50:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-02 01:50:24,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 01:50:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 118 states and 166 transitions. [2019-12-02 01:50:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2019-12-02 01:50:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-02 01:50:24,562 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 01:50:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 123 states and 177 transitions. [2019-12-02 01:50:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 177 transitions. [2019-12-02 01:50:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-02 01:50:24,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 126 states and 182 transitions. [2019-12-02 01:50:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2019-12-02 01:50:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 01:50:24,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 127 states and 183 transitions. [2019-12-02 01:50:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2019-12-02 01:50:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 01:50:24,838 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 130 states and 188 transitions. [2019-12-02 01:50:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2019-12-02 01:50:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 01:50:24,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 01:50:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 131 states and 188 transitions. [2019-12-02 01:50:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2019-12-02 01:50:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-02 01:50:24,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 132 states and 189 transitions. [2019-12-02 01:50:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2019-12-02 01:50:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 01:50:25,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 01:50:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 133 states and 190 transitions. [2019-12-02 01:50:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2019-12-02 01:50:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-02 01:50:25,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 01:50:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 134 states and 190 transitions. [2019-12-02 01:50:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2019-12-02 01:50:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-02 01:50:25,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 145 states and 208 transitions. [2019-12-02 01:50:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2019-12-02 01:50:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 01:50:25,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 156 states and 226 transitions. [2019-12-02 01:50:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2019-12-02 01:50:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 01:50:25,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 157 states and 227 transitions. [2019-12-02 01:50:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 227 transitions. [2019-12-02 01:50:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-02 01:50:25,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 158 states and 228 transitions. [2019-12-02 01:50:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2019-12-02 01:50:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 01:50:25,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 158 states and 227 transitions. [2019-12-02 01:50:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2019-12-02 01:50:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-02 01:50:25,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 163 states and 233 transitions. [2019-12-02 01:50:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 233 transitions. [2019-12-02 01:50:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 01:50:25,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 163 states and 231 transitions. [2019-12-02 01:50:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2019-12-02 01:50:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-02 01:50:25,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 01:50:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 168 states and 240 transitions. [2019-12-02 01:50:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2019-12-02 01:50:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 01:50:25,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 01:50:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 173 states and 247 transitions. [2019-12-02 01:50:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 247 transitions. [2019-12-02 01:50:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 01:50:26,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 01:50:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 173 states and 246 transitions. [2019-12-02 01:50:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2019-12-02 01:50:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-02 01:50:26,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 01:50:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 187 states and 269 transitions. [2019-12-02 01:50:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 269 transitions. [2019-12-02 01:50:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-02 01:50:27,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 01:50:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 189 states and 272 transitions. [2019-12-02 01:50:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2019-12-02 01:50:28,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-02 01:50:28,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 01:50:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 207 states and 300 transitions. [2019-12-02 01:50:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 300 transitions. [2019-12-02 01:50:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-02 01:50:30,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-02 01:50:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 212 states and 309 transitions. [2019-12-02 01:50:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 309 transitions. [2019-12-02 01:50:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-02 01:50:32,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 01:50:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 212 states and 308 transitions. [2019-12-02 01:50:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 308 transitions. [2019-12-02 01:50:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-02 01:50:32,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-02 01:50:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 224 states and 332 transitions. [2019-12-02 01:50:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-12-02 01:50:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-02 01:50:39,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-02 01:50:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 226 states and 334 transitions. [2019-12-02 01:50:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 334 transitions. [2019-12-02 01:50:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-02 01:50:40,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-02 01:50:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 228 states and 336 transitions. [2019-12-02 01:50:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 336 transitions. [2019-12-02 01:50:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-02 01:50:40,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 01:50:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 228 states and 335 transitions. [2019-12-02 01:50:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 335 transitions. [2019-12-02 01:50:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 01:50:41,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-02 01:50:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 249 states and 381 transitions. [2019-12-02 01:50:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 381 transitions. [2019-12-02 01:50:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-02 01:50:48,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-02 01:50:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 254 states and 392 transitions. [2019-12-02 01:50:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 392 transitions. [2019-12-02 01:50:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 01:50:50,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 01:50:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 263 states and 408 transitions. [2019-12-02 01:50:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 408 transitions. [2019-12-02 01:50:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-02 01:50:51,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 01:50:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 271 states and 424 transitions. [2019-12-02 01:50:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 424 transitions. [2019-12-02 01:50:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-02 01:50:57,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-02 01:50:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 274 states and 429 transitions. [2019-12-02 01:50:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 429 transitions. [2019-12-02 01:50:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-02 01:50:57,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:50:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 277 states and 437 transitions. [2019-12-02 01:50:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 437 transitions. [2019-12-02 01:50:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-02 01:50:57,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:50:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 281 states and 446 transitions. [2019-12-02 01:50:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 446 transitions. [2019-12-02 01:50:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-02 01:50:59,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-02 01:50:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 284 states and 451 transitions. [2019-12-02 01:50:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 451 transitions. [2019-12-02 01:50:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-02 01:50:59,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:50:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 285 states and 452 transitions. [2019-12-02 01:50:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 452 transitions. [2019-12-02 01:50:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-02 01:50:59,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:50:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:50:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:50:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 286 states and 452 transitions. [2019-12-02 01:50:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 452 transitions. [2019-12-02 01:50:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-02 01:50:59,981 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:50:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:51:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 287 states and 453 transitions. [2019-12-02 01:51:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 453 transitions. [2019-12-02 01:51:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 01:51:00,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:51:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 288 states and 453 transitions. [2019-12-02 01:51:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 453 transitions. [2019-12-02 01:51:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 01:51:00,096 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:51:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 289 states and 453 transitions. [2019-12-02 01:51:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 453 transitions. [2019-12-02 01:51:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 01:51:00,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:51:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 290 states and 454 transitions. [2019-12-02 01:51:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 454 transitions. [2019-12-02 01:51:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-02 01:51:00,202 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 01:51:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 291 states and 454 transitions. [2019-12-02 01:51:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 454 transitions. [2019-12-02 01:51:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-02 01:51:00,257 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-02 01:51:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 300 states and 470 transitions. [2019-12-02 01:51:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 470 transitions. [2019-12-02 01:51:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-02 01:51:00,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-02 01:51:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 306 states and 480 transitions. [2019-12-02 01:51:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 480 transitions. [2019-12-02 01:51:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-02 01:51:03,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-02 01:51:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 307 states and 480 transitions. [2019-12-02 01:51:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 480 transitions. [2019-12-02 01:51:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-02 01:51:03,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-02 01:51:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 320 states and 506 transitions. [2019-12-02 01:51:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 506 transitions. [2019-12-02 01:51:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-02 01:51:13,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 01:51:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 331 states and 531 transitions. [2019-12-02 01:51:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 531 transitions. [2019-12-02 01:51:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-02 01:51:18,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 01:51:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 336 states and 542 transitions. [2019-12-02 01:51:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 542 transitions. [2019-12-02 01:51:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-02 01:51:19,045 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 01:51:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 337 states and 542 transitions. [2019-12-02 01:51:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 542 transitions. [2019-12-02 01:51:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-02 01:51:19,136 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-02 01:51:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 354 states and 573 transitions. [2019-12-02 01:51:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 573 transitions. [2019-12-02 01:51:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-02 01:51:20,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 01:51:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 355 states and 574 transitions. [2019-12-02 01:51:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 574 transitions. [2019-12-02 01:51:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-02 01:51:20,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-02 01:51:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 356 states and 574 transitions. [2019-12-02 01:51:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 574 transitions. [2019-12-02 01:51:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-02 01:51:20,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 01:51:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 358 states and 577 transitions. [2019-12-02 01:51:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 577 transitions. [2019-12-02 01:51:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-02 01:51:21,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 01:51:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 359 states and 579 transitions. [2019-12-02 01:51:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 579 transitions. [2019-12-02 01:51:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-02 01:51:21,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 364 states and 595 transitions. [2019-12-02 01:51:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 595 transitions. [2019-12-02 01:51:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-02 01:51:24,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 368 states and 599 transitions. [2019-12-02 01:51:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 599 transitions. [2019-12-02 01:51:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-02 01:51:25,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 370 states and 600 transitions. [2019-12-02 01:51:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 600 transitions. [2019-12-02 01:51:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-02 01:51:25,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 372 states and 602 transitions. [2019-12-02 01:51:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-12-02 01:51:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-02 01:51:26,040 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 373 states and 602 transitions. [2019-12-02 01:51:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 602 transitions. [2019-12-02 01:51:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-02 01:51:26,109 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 374 states and 602 transitions. [2019-12-02 01:51:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 602 transitions. [2019-12-02 01:51:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-02 01:51:26,176 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 375 states and 602 transitions. [2019-12-02 01:51:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 602 transitions. [2019-12-02 01:51:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-02 01:51:26,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-02 01:51:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 382 states and 618 transitions. [2019-12-02 01:51:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 618 transitions. [2019-12-02 01:51:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-02 01:51:29,127 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 01:51:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 386 states and 627 transitions. [2019-12-02 01:51:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 627 transitions. [2019-12-02 01:51:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-02 01:51:29,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 01:51:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 387 states and 627 transitions. [2019-12-02 01:51:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 627 transitions. [2019-12-02 01:51:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 01:51:29,785 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-02 01:51:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 407 states and 664 transitions. [2019-12-02 01:51:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 664 transitions. [2019-12-02 01:51:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-02 01:51:33,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-02 01:51:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 429 states and 706 transitions. [2019-12-02 01:51:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-12-02 01:51:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-02 01:51:38,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-02 01:51:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 430 states and 706 transitions. [2019-12-02 01:51:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 706 transitions. [2019-12-02 01:51:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 01:51:39,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-02 01:51:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 431 states and 707 transitions. [2019-12-02 01:51:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 707 transitions. [2019-12-02 01:51:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 01:51:39,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-02 01:51:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 432 states and 707 transitions. [2019-12-02 01:51:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 707 transitions. [2019-12-02 01:51:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-02 01:51:39,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 439 states and 717 transitions. [2019-12-02 01:51:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 717 transitions. [2019-12-02 01:51:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 01:51:40,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 440 states and 717 transitions. [2019-12-02 01:51:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 717 transitions. [2019-12-02 01:51:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 01:51:40,610 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-02 01:51:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 443 states and 728 transitions. [2019-12-02 01:51:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 728 transitions. [2019-12-02 01:51:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-02 01:51:48,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-02 01:51:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 444 states and 730 transitions. [2019-12-02 01:51:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 730 transitions. [2019-12-02 01:51:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-02 01:51:49,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-02 01:51:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 448 states and 739 transitions. [2019-12-02 01:51:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 739 transitions. [2019-12-02 01:51:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 01:51:51,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-02 01:51:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 452 states and 748 transitions. [2019-12-02 01:51:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 748 transitions. [2019-12-02 01:51:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 01:51:54,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-02 01:51:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 453 states and 748 transitions. [2019-12-02 01:51:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 748 transitions. [2019-12-02 01:51:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 01:51:54,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-02 01:51:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 454 states and 748 transitions. [2019-12-02 01:51:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 748 transitions. [2019-12-02 01:51:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-02 01:51:54,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-02 01:51:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 455 states and 749 transitions. [2019-12-02 01:51:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 749 transitions. [2019-12-02 01:51:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-02 01:51:55,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 462 states and 759 transitions. [2019-12-02 01:51:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 759 transitions. [2019-12-02 01:51:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-02 01:51:56,429 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-02 01:51:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 463 states and 760 transitions. [2019-12-02 01:51:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 760 transitions. [2019-12-02 01:51:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-02 01:51:56,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 470 states and 770 transitions. [2019-12-02 01:51:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 770 transitions. [2019-12-02 01:51:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-02 01:51:58,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 471 states and 770 transitions. [2019-12-02 01:51:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 770 transitions. [2019-12-02 01:51:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-02 01:51:58,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 01:51:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 01:51:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-02 01:51:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 01:51:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 197 states and 277 transitions. [2019-12-02 01:51:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 277 transitions. [2019-12-02 01:51:58,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-02 01:51:58,868 WARN L425 CodeCheckObserver]: This Program is SAFE, Check terminated with 89 iterations. [2019-12-02 01:51:58,875 INFO L765 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2019-12-02 01:51:59,426 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,430 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,431 INFO L569 CodeCheckObserver]: Invariant with dag size 6 [2019-12-02 01:51:59,433 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,433 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,433 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,433 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,434 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,434 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,434 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,434 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,434 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,434 INFO L569 CodeCheckObserver]: Invariant with dag size 6 [2019-12-02 01:51:59,434 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,435 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,435 INFO L569 CodeCheckObserver]: Invariant with dag size 6 [2019-12-02 01:51:59,435 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,435 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,435 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,436 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,436 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,436 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,436 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 01:51:59,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 01:51:59 ImpRootNode [2019-12-02 01:51:59,436 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 01:51:59,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 01:51:59,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 01:51:59,437 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 01:51:59,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:50:23" (3/4) ... [2019-12-02 01:51:59,439 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-02 01:51:59,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2019-12-02 01:51:59,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2019-12-02 01:51:59,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2019-12-02 01:51:59,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2019-12-02 01:51:59,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2019-12-02 01:51:59,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2019-12-02 01:51:59,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2019-12-02 01:51:59,443 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2019-12-02 01:51:59,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2019-12-02 01:51:59,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2019-12-02 01:51:59,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2019-12-02 01:51:59,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2019-12-02 01:51:59,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2019-12-02 01:51:59,454 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 90 nodes and edges [2019-12-02 01:51:59,455 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-12-02 01:51:59,456 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-02 01:51:59,457 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-02 01:51:59,458 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-02 01:51:59,480 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(ldv_coherent_state) == ldv_coherent_state || ldv_coherent_state < 1 [2019-12-02 01:51:59,481 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ldv_urb_state < 1 || ldv_urb_state == \old(ldv_urb_state) [2019-12-02 01:51:59,589 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_68e5810a-df08-46ba-929f-ab8fcb7cb14e/bin/ukojak/witness.graphml [2019-12-02 01:51:59,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 01:51:59,591 INFO L168 Benchmark]: Toolchain (without parser) took 101781.17 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.4 MB). Free memory was 937.1 MB in the beginning and 900.5 MB in the end (delta: 36.6 MB). Peak memory consumption was 401.0 MB. Max. memory is 11.5 GB. [2019-12-02 01:51:59,591 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 01:51:59,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-12-02 01:51:59,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.78 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-12-02 01:51:59,592 INFO L168 Benchmark]: Boogie Preprocessor took 50.91 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-12-02 01:51:59,592 INFO L168 Benchmark]: RCFGBuilder took 5334.38 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: -11.1 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. [2019-12-02 01:51:59,593 INFO L168 Benchmark]: CodeCheck took 95540.12 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 975.4 MB in the end (delta: 89.3 MB). Peak memory consumption was 314.2 MB. Max. memory is 11.5 GB. [2019-12-02 01:51:59,593 INFO L168 Benchmark]: Witness Printer took 153.28 ms. Allocated memory is still 1.4 GB. Free memory was 975.4 MB in the beginning and 900.5 MB in the end (delta: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. [2019-12-02 01:51:59,594 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 14 procedures, 109 locations, 1 error locations. Result: SAFE, OverallTime: 94.9s, OverallIterations: 89, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 16777216 SDtfs, -1015529264 SDslu, 2067158852 SDs, 0 SdLazy, -1403459092 SolverSat, -1277824864 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 530.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60522 GetRequests, 59000 SyntacticMatches, 1012 SemanticMatches, 510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139104 ImplicationChecksByTransitivity, 76.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 6648 NumberOfCodeBlocks, 6648 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 6560 ConstructedInterpolants, 0 QuantifiedInterpolants, 1502388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 88 InterpolantComputations, 56 PerfectInterpolantSequences, 2108/2375 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3771]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3415]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3986]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3830]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4061]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3871]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3983]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3969]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3502]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4170]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4139]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4113]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3518]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3898]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4143]: Loop Invariant Derived loop invariant: ldv_urb_state < 1 || ldv_urb_state == \old(ldv_urb_state) - InvariantResult [Line: 3840]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4118]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: \old(ldv_coherent_state) == ldv_coherent_state || ldv_coherent_state < 1 - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3864]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4044]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: 1 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.78 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 50.91 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. * RCFGBuilder took 5334.38 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: -11.1 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. * CodeCheck took 95540.12 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 975.4 MB in the end (delta: 89.3 MB). Peak memory consumption was 314.2 MB. Max. memory is 11.5 GB. * Witness Printer took 153.28 ms. Allocated memory is still 1.4 GB. Free memory was 975.4 MB in the beginning and 900.5 MB in the end (delta: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...