./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01f13171516d4f69f147a7da46701d33e421de64 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:48:20,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:48:20,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:48:20,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:48:20,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:48:20,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:48:20,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:48:20,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:48:20,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:48:20,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:48:20,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:48:20,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:48:20,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:48:20,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:48:20,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:48:20,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:48:20,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:48:20,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:48:20,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:48:20,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:48:20,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:48:20,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:48:20,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:48:20,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:48:20,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:48:20,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:48:20,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:48:20,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:48:20,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:48:20,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:48:20,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:48:20,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:48:20,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:48:20,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:48:20,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:48:20,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:48:20,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:48:20,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:48:20,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:48:20,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:48:20,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:48:20,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-19 21:48:20,928 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:48:20,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:48:20,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:48:20,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:48:20,930 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:48:20,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:48:20,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:48:20,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:48:20,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:48:20,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:48:20,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:48:20,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:48:20,932 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:48:20,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:48:20,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:48:20,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:48:20,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:48:20,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:48:20,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:48:20,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:48:20,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:48:20,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:48:20,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:48:20,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:48:20,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:48:20,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 21:48:20,936 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01f13171516d4f69f147a7da46701d33e421de64 [2019-11-19 21:48:21,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:48:21,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:48:21,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:48:21,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:48:21,269 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:48:21,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-11-19 21:48:21,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b96171e5/f4e6550de3a545c8864e49183f7af617/FLAG860bab674 [2019-11-19 21:48:22,021 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:48:22,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-11-19 21:48:22,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b96171e5/f4e6550de3a545c8864e49183f7af617/FLAG860bab674 [2019-11-19 21:48:22,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b96171e5/f4e6550de3a545c8864e49183f7af617 [2019-11-19 21:48:22,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:48:22,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:48:22,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:48:22,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:48:22,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:48:22,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:22" (1/1) ... [2019-11-19 21:48:22,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67df1432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:22, skipping insertion in model container [2019-11-19 21:48:22,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:22" (1/1) ... [2019-11-19 21:48:22,188 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:48:22,313 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:48:23,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:48:23,501 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:48:23,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:48:23,842 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:48:23,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23 WrapperNode [2019-11-19 21:48:23,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:48:23,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:48:23,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:48:23,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:48:23,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:23,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:24,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:48:24,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:48:24,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:48:24,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:48:24,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:24,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:24,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:24,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:24,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:24,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:24,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... [2019-11-19 21:48:24,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:48:24,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:48:24,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:48:24,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:48:24,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:48:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 21:48:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:48:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:48:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 21:48:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:48:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-19 21:48:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:48:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 21:48:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:48:24,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:48:24,881 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 21:48:24,887 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 21:48:24,891 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 21:48:24,894 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 21:48:24,932 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 21:48:28,050 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2019-11-19 21:48:28,050 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2019-11-19 21:48:28,050 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2019-11-19 21:48:28,050 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2019-11-19 21:48:28,051 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##334: assume !false; [2019-11-19 21:48:28,051 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##333: assume false; [2019-11-19 21:48:28,051 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2019-11-19 21:48:28,051 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2019-11-19 21:48:28,051 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2019-11-19 21:48:28,051 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2019-11-19 21:48:28,053 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:48:28,053 INFO L285 CfgBuilder]: Removed 156 assume(true) statements. [2019-11-19 21:48:28,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:28 BoogieIcfgContainer [2019-11-19 21:48:28,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:48:28,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:48:28,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:48:28,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:48:28,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:48:22" (1/3) ... [2019-11-19 21:48:28,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c8d306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:28, skipping insertion in model container [2019-11-19 21:48:28,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:23" (2/3) ... [2019-11-19 21:48:28,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c8d306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:28, skipping insertion in model container [2019-11-19 21:48:28,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:28" (3/3) ... [2019-11-19 21:48:28,064 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-11-19 21:48:28,076 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:48:28,084 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-19 21:48:28,097 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-19 21:48:28,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:48:28,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:48:28,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:48:28,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:48:28,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:48:28,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:48:28,129 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:48:28,129 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:48:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2019-11-19 21:48:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:48:28,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:28,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:28,162 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash 986721245, now seen corresponding path program 1 times [2019-11-19 21:48:28,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:28,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105564906] [2019-11-19 21:48:28,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:28,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105564906] [2019-11-19 21:48:28,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:28,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:28,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888297758] [2019-11-19 21:48:28,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:28,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:28,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:28,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:28,814 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 4 states. [2019-11-19 21:48:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:29,297 INFO L93 Difference]: Finished difference Result 776 states and 1190 transitions. [2019-11-19 21:48:29,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:48:29,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 21:48:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:29,329 INFO L225 Difference]: With dead ends: 776 [2019-11-19 21:48:29,329 INFO L226 Difference]: Without dead ends: 494 [2019-11-19 21:48:29,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:48:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-11-19 21:48:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 268. [2019-11-19 21:48:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-19 21:48:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2019-11-19 21:48:29,443 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 12 [2019-11-19 21:48:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:29,444 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2019-11-19 21:48:29,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2019-11-19 21:48:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:48:29,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:29,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:29,445 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:29,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1666779615, now seen corresponding path program 1 times [2019-11-19 21:48:29,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:29,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898666702] [2019-11-19 21:48:29,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:29,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898666702] [2019-11-19 21:48:29,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:29,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:48:29,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493831448] [2019-11-19 21:48:29,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:48:29,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:29,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:48:29,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:29,641 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand 3 states. [2019-11-19 21:48:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:29,682 INFO L93 Difference]: Finished difference Result 769 states and 1032 transitions. [2019-11-19 21:48:29,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:48:29,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-19 21:48:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:29,686 INFO L225 Difference]: With dead ends: 769 [2019-11-19 21:48:29,686 INFO L226 Difference]: Without dead ends: 515 [2019-11-19 21:48:29,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-19 21:48:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-11-19 21:48:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-11-19 21:48:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 687 transitions. [2019-11-19 21:48:29,714 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 687 transitions. Word has length 12 [2019-11-19 21:48:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:29,714 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 687 transitions. [2019-11-19 21:48:29,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:48:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 687 transitions. [2019-11-19 21:48:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 21:48:29,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:29,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:29,716 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash 130559946, now seen corresponding path program 1 times [2019-11-19 21:48:29,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:29,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827323482] [2019-11-19 21:48:29,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:29,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827323482] [2019-11-19 21:48:29,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:29,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:48:29,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886307047] [2019-11-19 21:48:29,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:48:29,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:48:29,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:29,890 INFO L87 Difference]: Start difference. First operand 511 states and 687 transitions. Second operand 3 states. [2019-11-19 21:48:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:29,906 INFO L93 Difference]: Finished difference Result 511 states and 687 transitions. [2019-11-19 21:48:29,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:48:29,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 21:48:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:29,909 INFO L225 Difference]: With dead ends: 511 [2019-11-19 21:48:29,910 INFO L226 Difference]: Without dead ends: 505 [2019-11-19 21:48:29,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-19 21:48:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-11-19 21:48:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-19 21:48:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 678 transitions. [2019-11-19 21:48:29,930 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 678 transitions. Word has length 13 [2019-11-19 21:48:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:29,931 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 678 transitions. [2019-11-19 21:48:29,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:48:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 678 transitions. [2019-11-19 21:48:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-19 21:48:29,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:29,934 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:29,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:29,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash -946322374, now seen corresponding path program 1 times [2019-11-19 21:48:29,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:29,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233424371] [2019-11-19 21:48:29,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:30,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233424371] [2019-11-19 21:48:30,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:30,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:30,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549953239] [2019-11-19 21:48:30,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:30,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:30,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:30,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:30,189 INFO L87 Difference]: Start difference. First operand 505 states and 678 transitions. Second operand 4 states. [2019-11-19 21:48:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:30,502 INFO L93 Difference]: Finished difference Result 1434 states and 1943 transitions. [2019-11-19 21:48:30,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:48:30,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-19 21:48:30,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:30,510 INFO L225 Difference]: With dead ends: 1434 [2019-11-19 21:48:30,510 INFO L226 Difference]: Without dead ends: 943 [2019-11-19 21:48:30,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:48:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-11-19 21:48:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 931. [2019-11-19 21:48:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-11-19 21:48:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1269 transitions. [2019-11-19 21:48:30,562 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1269 transitions. Word has length 48 [2019-11-19 21:48:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:30,563 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1269 transitions. [2019-11-19 21:48:30,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1269 transitions. [2019-11-19 21:48:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-19 21:48:30,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:30,575 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:30,575 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash 439881020, now seen corresponding path program 1 times [2019-11-19 21:48:30,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:30,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12489707] [2019-11-19 21:48:30,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:30,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12489707] [2019-11-19 21:48:30,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:30,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:48:30,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141785344] [2019-11-19 21:48:30,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:30,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:30,785 INFO L87 Difference]: Start difference. First operand 931 states and 1269 transitions. Second operand 4 states. [2019-11-19 21:48:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:31,123 INFO L93 Difference]: Finished difference Result 2412 states and 3289 transitions. [2019-11-19 21:48:31,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:48:31,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-19 21:48:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:31,133 INFO L225 Difference]: With dead ends: 2412 [2019-11-19 21:48:31,134 INFO L226 Difference]: Without dead ends: 1947 [2019-11-19 21:48:31,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:48:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-11-19 21:48:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 935. [2019-11-19 21:48:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-11-19 21:48:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1273 transitions. [2019-11-19 21:48:31,195 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1273 transitions. Word has length 48 [2019-11-19 21:48:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:31,195 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1273 transitions. [2019-11-19 21:48:31,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1273 transitions. [2019-11-19 21:48:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:48:31,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:31,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:31,198 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:31,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:31,198 INFO L82 PathProgramCache]: Analyzing trace with hash -502576155, now seen corresponding path program 1 times [2019-11-19 21:48:31,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:31,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457467361] [2019-11-19 21:48:31,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:31,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457467361] [2019-11-19 21:48:31,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:31,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:48:31,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954802460] [2019-11-19 21:48:31,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:31,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:31,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:31,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:31,400 INFO L87 Difference]: Start difference. First operand 935 states and 1273 transitions. Second operand 4 states. [2019-11-19 21:48:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:31,661 INFO L93 Difference]: Finished difference Result 2659 states and 3642 transitions. [2019-11-19 21:48:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:48:31,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-19 21:48:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:31,679 INFO L225 Difference]: With dead ends: 2659 [2019-11-19 21:48:31,679 INFO L226 Difference]: Without dead ends: 1738 [2019-11-19 21:48:31,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:48:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-11-19 21:48:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 909. [2019-11-19 21:48:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-11-19 21:48:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1237 transitions. [2019-11-19 21:48:31,775 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1237 transitions. Word has length 50 [2019-11-19 21:48:31,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:31,784 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1237 transitions. [2019-11-19 21:48:31,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1237 transitions. [2019-11-19 21:48:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:48:31,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:31,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:31,787 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1089382169, now seen corresponding path program 1 times [2019-11-19 21:48:31,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:31,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052175274] [2019-11-19 21:48:31,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:32,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052175274] [2019-11-19 21:48:32,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:32,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:32,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448371649] [2019-11-19 21:48:32,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:32,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:32,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:32,045 INFO L87 Difference]: Start difference. First operand 909 states and 1237 transitions. Second operand 4 states. [2019-11-19 21:48:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:32,396 INFO L93 Difference]: Finished difference Result 4079 states and 5556 transitions. [2019-11-19 21:48:32,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:48:32,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-19 21:48:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:32,413 INFO L225 Difference]: With dead ends: 4079 [2019-11-19 21:48:32,414 INFO L226 Difference]: Without dead ends: 3184 [2019-11-19 21:48:32,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:48:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-11-19 21:48:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 1735. [2019-11-19 21:48:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-11-19 21:48:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2356 transitions. [2019-11-19 21:48:32,553 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2356 transitions. Word has length 50 [2019-11-19 21:48:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:32,554 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2356 transitions. [2019-11-19 21:48:32,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2356 transitions. [2019-11-19 21:48:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:48:32,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:32,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:32,557 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:32,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:32,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1353156781, now seen corresponding path program 1 times [2019-11-19 21:48:32,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:32,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741062575] [2019-11-19 21:48:32,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:32,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741062575] [2019-11-19 21:48:32,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:32,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:32,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188119386] [2019-11-19 21:48:32,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:32,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:32,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:32,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:32,798 INFO L87 Difference]: Start difference. First operand 1735 states and 2356 transitions. Second operand 4 states. [2019-11-19 21:48:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:33,249 INFO L93 Difference]: Finished difference Result 3395 states and 4597 transitions. [2019-11-19 21:48:33,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:48:33,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-19 21:48:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:33,258 INFO L225 Difference]: With dead ends: 3395 [2019-11-19 21:48:33,258 INFO L226 Difference]: Without dead ends: 1674 [2019-11-19 21:48:33,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:48:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-11-19 21:48:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1659. [2019-11-19 21:48:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-11-19 21:48:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2240 transitions. [2019-11-19 21:48:33,363 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2240 transitions. Word has length 50 [2019-11-19 21:48:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:33,364 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 2240 transitions. [2019-11-19 21:48:33,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2240 transitions. [2019-11-19 21:48:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 21:48:33,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:33,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:33,366 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1701579105, now seen corresponding path program 1 times [2019-11-19 21:48:33,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:33,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301267662] [2019-11-19 21:48:33,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:33,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301267662] [2019-11-19 21:48:33,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:33,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:33,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717452921] [2019-11-19 21:48:33,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:33,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:33,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:33,533 INFO L87 Difference]: Start difference. First operand 1659 states and 2240 transitions. Second operand 4 states. [2019-11-19 21:48:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:34,718 INFO L93 Difference]: Finished difference Result 2514 states and 3396 transitions. [2019-11-19 21:48:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:48:34,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 21:48:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:34,733 INFO L225 Difference]: With dead ends: 2514 [2019-11-19 21:48:34,734 INFO L226 Difference]: Without dead ends: 2510 [2019-11-19 21:48:34,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-11-19 21:48:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2505. [2019-11-19 21:48:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-11-19 21:48:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3384 transitions. [2019-11-19 21:48:34,892 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3384 transitions. Word has length 58 [2019-11-19 21:48:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:34,892 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 3384 transitions. [2019-11-19 21:48:34,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3384 transitions. [2019-11-19 21:48:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 21:48:34,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:34,895 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:34,895 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1031851433, now seen corresponding path program 1 times [2019-11-19 21:48:34,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:34,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382169259] [2019-11-19 21:48:34,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:35,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382169259] [2019-11-19 21:48:35,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:35,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:35,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317019650] [2019-11-19 21:48:35,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:48:35,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:48:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:35,063 INFO L87 Difference]: Start difference. First operand 2505 states and 3384 transitions. Second operand 3 states. [2019-11-19 21:48:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:35,221 INFO L93 Difference]: Finished difference Result 3428 states and 4620 transitions. [2019-11-19 21:48:35,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:48:35,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-19 21:48:35,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:35,230 INFO L225 Difference]: With dead ends: 3428 [2019-11-19 21:48:35,230 INFO L226 Difference]: Without dead ends: 1721 [2019-11-19 21:48:35,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-19 21:48:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2019-11-19 21:48:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2019-11-19 21:48:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2302 transitions. [2019-11-19 21:48:35,348 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2302 transitions. Word has length 64 [2019-11-19 21:48:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:35,349 INFO L462 AbstractCegarLoop]: Abstraction has 1721 states and 2302 transitions. [2019-11-19 21:48:35,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:48:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2302 transitions. [2019-11-19 21:48:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 21:48:35,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:35,351 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:35,351 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:35,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:35,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1779804946, now seen corresponding path program 1 times [2019-11-19 21:48:35,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:35,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130014553] [2019-11-19 21:48:35,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:48:36,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130014553] [2019-11-19 21:48:36,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:36,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:48:36,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067581325] [2019-11-19 21:48:36,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:48:36,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:36,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:48:36,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:48:36,118 INFO L87 Difference]: Start difference. First operand 1721 states and 2302 transitions. Second operand 5 states. [2019-11-19 21:48:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:36,277 INFO L93 Difference]: Finished difference Result 3430 states and 4590 transitions. [2019-11-19 21:48:36,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:48:36,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-19 21:48:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:36,286 INFO L225 Difference]: With dead ends: 3430 [2019-11-19 21:48:36,286 INFO L226 Difference]: Without dead ends: 1719 [2019-11-19 21:48:36,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:48:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-19 21:48:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-19 21:48:36,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-19 21:48:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2298 transitions. [2019-11-19 21:48:36,390 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2298 transitions. Word has length 66 [2019-11-19 21:48:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:36,391 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2298 transitions. [2019-11-19 21:48:36,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:48:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2298 transitions. [2019-11-19 21:48:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-19 21:48:36,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:36,393 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:36,394 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 981368905, now seen corresponding path program 1 times [2019-11-19 21:48:36,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:36,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433925416] [2019-11-19 21:48:36,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:48:36,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433925416] [2019-11-19 21:48:36,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:36,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:36,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787129884] [2019-11-19 21:48:36,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:36,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:36,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:36,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:36,940 INFO L87 Difference]: Start difference. First operand 1719 states and 2298 transitions. Second operand 4 states. [2019-11-19 21:48:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:38,029 INFO L93 Difference]: Finished difference Result 1719 states and 2298 transitions. [2019-11-19 21:48:38,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:48:38,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-19 21:48:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:38,031 INFO L225 Difference]: With dead ends: 1719 [2019-11-19 21:48:38,031 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:48:38,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:48:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:48:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:48:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:48:38,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2019-11-19 21:48:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:38,035 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:48:38,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:48:38,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:48:38,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:48:40,209 INFO L444 ceAbstractionStarter]: For program point L3933(lines 3933 3939) no Hoare annotation was computed. [2019-11-19 21:48:40,209 INFO L440 ceAbstractionStarter]: At program point L3867(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,209 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4901) no Hoare annotation was computed. [2019-11-19 21:48:40,209 INFO L444 ceAbstractionStarter]: For program point L4132(lines 4132 4138) no Hoare annotation was computed. [2019-11-19 21:48:40,210 INFO L444 ceAbstractionStarter]: For program point L4066(lines 4066 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,210 INFO L444 ceAbstractionStarter]: For program point L4066-1(lines 4066 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,210 INFO L440 ceAbstractionStarter]: At program point L5057(lines 5056 5058) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,210 INFO L440 ceAbstractionStarter]: At program point L5124-1(lines 5036 5041) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,211 INFO L440 ceAbstractionStarter]: At program point L5124(lines 1 5145) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-19 21:48:40,211 INFO L444 ceAbstractionStarter]: For program point L4200(lines 4200 4255) no Hoare annotation was computed. [2019-11-19 21:48:40,211 INFO L440 ceAbstractionStarter]: At program point L4002loopEntry(lines 4002 4017) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,211 INFO L440 ceAbstractionStarter]: At program point L4267loopEntry(lines 4267 4277) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,211 INFO L440 ceAbstractionStarter]: At program point L4201(lines 4200 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,212 INFO L444 ceAbstractionStarter]: For program point L4069-1(lines 4069 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,212 INFO L444 ceAbstractionStarter]: For program point L4069(lines 4069 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,212 INFO L444 ceAbstractionStarter]: For program point L4003(line 4003) no Hoare annotation was computed. [2019-11-19 21:48:40,212 INFO L444 ceAbstractionStarter]: For program point L4268(line 4268) no Hoare annotation was computed. [2019-11-19 21:48:40,212 INFO L440 ceAbstractionStarter]: At program point L4070(lines 4066 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,212 INFO L444 ceAbstractionStarter]: For program point L4995(lines 4980 4996) no Hoare annotation was computed. [2019-11-19 21:48:40,212 INFO L444 ceAbstractionStarter]: For program point L4004(lines 4004 4015) no Hoare annotation was computed. [2019-11-19 21:48:40,213 INFO L440 ceAbstractionStarter]: At program point L4070-1(lines 4066 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,213 INFO L440 ceAbstractionStarter]: At program point L5061(lines 5060 5062) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,213 INFO L440 ceAbstractionStarter]: At program point L5061-1(lines 5060 5062) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,213 INFO L444 ceAbstractionStarter]: For program point L3872(line 3872) no Hoare annotation was computed. [2019-11-19 21:48:40,213 INFO L440 ceAbstractionStarter]: At program point L3674(lines 3667 3676) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,213 INFO L444 ceAbstractionStarter]: For program point L4203(lines 4203 4255) no Hoare annotation was computed. [2019-11-19 21:48:40,213 INFO L444 ceAbstractionStarter]: For program point L4269(lines 4269 4275) no Hoare annotation was computed. [2019-11-19 21:48:40,213 INFO L440 ceAbstractionStarter]: At program point L5128(lines 5127 5129) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,213 INFO L444 ceAbstractionStarter]: For program point L4005(lines 4005 4009) no Hoare annotation was computed. [2019-11-19 21:48:40,214 INFO L444 ceAbstractionStarter]: For program point L4005-2(lines 4005 4009) no Hoare annotation was computed. [2019-11-19 21:48:40,214 INFO L444 ceAbstractionStarter]: For program point L3873(lines 3873 3879) no Hoare annotation was computed. [2019-11-19 21:48:40,214 INFO L440 ceAbstractionStarter]: At program point L4204(lines 4203 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,214 INFO L444 ceAbstractionStarter]: For program point L4072(lines 4072 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,214 INFO L444 ceAbstractionStarter]: For program point L4072-1(lines 4072 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,214 INFO L440 ceAbstractionStarter]: At program point L4535(lines 4503 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,214 INFO L440 ceAbstractionStarter]: At program point L4469(lines 4457 4470) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,214 INFO L440 ceAbstractionStarter]: At program point L4073-1(lines 4072 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,215 INFO L440 ceAbstractionStarter]: At program point L4073(lines 4072 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,215 INFO L440 ceAbstractionStarter]: At program point L4998(lines 4976 5000) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse0 (= 0 ~ldv_coherent_state~0))) (or (and .cse0 .cse1 .cse2 (= ~ldv_urb_state~0 0)) (and (<= ~ldv_urb_state~0 1) (or (not .cse1) (not .cse2)) .cse0 (<= 1 ~ldv_urb_state~0)))) [2019-11-19 21:48:40,215 INFO L440 ceAbstractionStarter]: At program point L3611(lines 3608 3613) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,215 INFO L440 ceAbstractionStarter]: At program point L4338(lines 4321 4339) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,215 INFO L444 ceAbstractionStarter]: For program point L4206(lines 4206 4255) no Hoare annotation was computed. [2019-11-19 21:48:40,215 INFO L440 ceAbstractionStarter]: At program point L4140loopEntry(lines 4140 4196) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,215 INFO L440 ceAbstractionStarter]: At program point L3942(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,215 INFO L440 ceAbstractionStarter]: At program point L5065(lines 5064 5066) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,216 INFO L440 ceAbstractionStarter]: At program point L4207(lines 4206 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,216 INFO L444 ceAbstractionStarter]: For program point L4141(line 4141) no Hoare annotation was computed. [2019-11-19 21:48:40,216 INFO L444 ceAbstractionStarter]: For program point L4075-1(lines 4075 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,216 INFO L440 ceAbstractionStarter]: At program point L5132(lines 5131 5133) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-19 21:48:40,216 INFO L444 ceAbstractionStarter]: For program point L4075(lines 4075 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,216 INFO L440 ceAbstractionStarter]: At program point L3811loopEntry(lines 3811 3821) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,216 INFO L444 ceAbstractionStarter]: For program point L4538(lines 4538 4546) no Hoare annotation was computed. [2019-11-19 21:48:40,216 INFO L444 ceAbstractionStarter]: For program point L4538-2(lines 4538 4546) no Hoare annotation was computed. [2019-11-19 21:48:40,216 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4901) no Hoare annotation was computed. [2019-11-19 21:48:40,217 INFO L444 ceAbstractionStarter]: For program point L4142(lines 4142 4194) no Hoare annotation was computed. [2019-11-19 21:48:40,217 INFO L440 ceAbstractionStarter]: At program point L4076(lines 4075 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,217 INFO L440 ceAbstractionStarter]: At program point L4076-1(lines 4075 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,217 INFO L444 ceAbstractionStarter]: For program point L3812(line 3812) no Hoare annotation was computed. [2019-11-19 21:48:40,217 INFO L444 ceAbstractionStarter]: For program point L4209(lines 4209 4255) no Hoare annotation was computed. [2019-11-19 21:48:40,217 INFO L444 ceAbstractionStarter]: For program point L4143(lines 4143 4147) no Hoare annotation was computed. [2019-11-19 21:48:40,217 INFO L444 ceAbstractionStarter]: For program point L4143-2(lines 4143 4147) no Hoare annotation was computed. [2019-11-19 21:48:40,217 INFO L444 ceAbstractionStarter]: For program point L3813(lines 3813 3819) no Hoare annotation was computed. [2019-11-19 21:48:40,217 INFO L444 ceAbstractionStarter]: For program point L4606(lines 4606 4610) no Hoare annotation was computed. [2019-11-19 21:48:40,218 INFO L444 ceAbstractionStarter]: For program point L4606-2(lines 4606 4610) no Hoare annotation was computed. [2019-11-19 21:48:40,218 INFO L440 ceAbstractionStarter]: At program point L4210(lines 4209 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,218 INFO L444 ceAbstractionStarter]: For program point L4078(lines 4078 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,218 INFO L444 ceAbstractionStarter]: For program point L4078-1(lines 4078 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,218 INFO L444 ceAbstractionStarter]: For program point L4475(lines 4475 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,218 INFO L440 ceAbstractionStarter]: At program point L4079-1(lines 4078 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,218 INFO L440 ceAbstractionStarter]: At program point L4079(lines 4078 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,219 INFO L440 ceAbstractionStarter]: At program point L5136(lines 5135 5137) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,219 INFO L444 ceAbstractionStarter]: For program point L3947(line 3947) no Hoare annotation was computed. [2019-11-19 21:48:40,219 INFO L444 ceAbstractionStarter]: For program point L4806(lines 4806 4809) no Hoare annotation was computed. [2019-11-19 21:48:40,219 INFO L440 ceAbstractionStarter]: At program point L4476(lines 4475 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,219 INFO L440 ceAbstractionStarter]: At program point L4278(lines 4266 4279) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,219 INFO L444 ceAbstractionStarter]: For program point L4212(lines 4212 4255) no Hoare annotation was computed. [2019-11-19 21:48:40,219 INFO L444 ceAbstractionStarter]: For program point L3948(lines 3948 3954) no Hoare annotation was computed. [2019-11-19 21:48:40,219 INFO L440 ceAbstractionStarter]: At program point L3882(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,220 INFO L440 ceAbstractionStarter]: At program point L3684(lines 3678 3686) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-19 21:48:40,220 INFO L440 ceAbstractionStarter]: At program point L3618loopEntry(lines 3618 3624) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,220 INFO L440 ceAbstractionStarter]: At program point L4213(lines 4212 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,220 INFO L444 ceAbstractionStarter]: For program point L4081-1(lines 4081 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,220 INFO L444 ceAbstractionStarter]: For program point L4081(lines 4081 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,220 INFO L440 ceAbstractionStarter]: At program point L5006loopEntry(lines 5006 5025) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,220 INFO L440 ceAbstractionStarter]: At program point L5006-2loopEntry(lines 5006 5025) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,221 INFO L444 ceAbstractionStarter]: For program point L3619(line 3619) no Hoare annotation was computed. [2019-11-19 21:48:40,221 INFO L444 ceAbstractionStarter]: For program point L4478(lines 4478 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,221 INFO L444 ceAbstractionStarter]: For program point L4346(lines 4346 4356) no Hoare annotation was computed. [2019-11-19 21:48:40,221 INFO L444 ceAbstractionStarter]: For program point L4346-2(lines 4346 4356) no Hoare annotation was computed. [2019-11-19 21:48:40,221 INFO L444 ceAbstractionStarter]: For program point L4148(lines 4148 4152) no Hoare annotation was computed. [2019-11-19 21:48:40,221 INFO L440 ceAbstractionStarter]: At program point L4082(lines 4081 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,221 INFO L444 ceAbstractionStarter]: For program point L4148-2(lines 4148 4152) no Hoare annotation was computed. [2019-11-19 21:48:40,221 INFO L444 ceAbstractionStarter]: For program point L5007(lines 5006 5025) no Hoare annotation was computed. [2019-11-19 21:48:40,221 INFO L440 ceAbstractionStarter]: At program point L4082-1(lines 4081 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,221 INFO L444 ceAbstractionStarter]: For program point L5007-1(lines 5006 5025) no Hoare annotation was computed. [2019-11-19 21:48:40,223 INFO L440 ceAbstractionStarter]: At program point L4479(lines 4478 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,223 INFO L444 ceAbstractionStarter]: For program point L4215(lines 4215 4255) no Hoare annotation was computed. [2019-11-19 21:48:40,223 INFO L440 ceAbstractionStarter]: At program point L5140-1(lines 5139 5141) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,223 INFO L440 ceAbstractionStarter]: At program point L5140-2(lines 5139 5141) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,224 INFO L440 ceAbstractionStarter]: At program point L5140(lines 5139 5141) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,224 INFO L444 ceAbstractionStarter]: For program point L5008-1(lines 5006 5025) no Hoare annotation was computed. [2019-11-19 21:48:40,224 INFO L440 ceAbstractionStarter]: At program point L5140-3(lines 5139 5141) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,224 INFO L444 ceAbstractionStarter]: For program point L5008(lines 5006 5025) no Hoare annotation was computed. [2019-11-19 21:48:40,224 INFO L440 ceAbstractionStarter]: At program point L4216(lines 4215 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,224 INFO L440 ceAbstractionStarter]: At program point L5075(lines 4849 4852) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,224 INFO L440 ceAbstractionStarter]: At program point L4084(lines 4083 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,224 INFO L440 ceAbstractionStarter]: At program point L4084-1(lines 4083 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,225 INFO L444 ceAbstractionStarter]: For program point L4481(lines 4481 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,225 INFO L440 ceAbstractionStarter]: At program point L4283-2(lines 4283 4291) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,225 INFO L444 ceAbstractionStarter]: For program point L3887(line 3887) no Hoare annotation was computed. [2019-11-19 21:48:40,225 INFO L444 ceAbstractionStarter]: For program point L4614(lines 4614 4617) no Hoare annotation was computed. [2019-11-19 21:48:40,225 INFO L440 ceAbstractionStarter]: At program point L4482(lines 4481 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,225 INFO L444 ceAbstractionStarter]: For program point L4218(lines 4218 4255) no Hoare annotation was computed. [2019-11-19 21:48:40,225 INFO L444 ceAbstractionStarter]: For program point L4284(lines 4283 4291) no Hoare annotation was computed. [2019-11-19 21:48:40,225 INFO L440 ceAbstractionStarter]: At program point L5143(lines 1 5145) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,225 INFO L444 ceAbstractionStarter]: For program point L5143-1(lines 5143 5145) no Hoare annotation was computed. [2019-11-19 21:48:40,226 INFO L444 ceAbstractionStarter]: For program point L5143-2(lines 5143 5145) no Hoare annotation was computed. [2019-11-19 21:48:40,226 INFO L444 ceAbstractionStarter]: For program point L3888(lines 3888 3894) no Hoare annotation was computed. [2019-11-19 21:48:40,226 INFO L440 ceAbstractionStarter]: At program point L3822(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,226 INFO L444 ceAbstractionStarter]: For program point L4813(line 4813) no Hoare annotation was computed. [2019-11-19 21:48:40,226 INFO L440 ceAbstractionStarter]: At program point L4219(lines 4218 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,226 INFO L444 ceAbstractionStarter]: For program point L4285(lines 4285 4288) no Hoare annotation was computed. [2019-11-19 21:48:40,226 INFO L440 ceAbstractionStarter]: At program point L5078(lines 5077 5079) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-19 21:48:40,226 INFO L444 ceAbstractionStarter]: For program point L4153(lines 4153 4157) no Hoare annotation was computed. [2019-11-19 21:48:40,227 INFO L444 ceAbstractionStarter]: For program point L4153-2(lines 4153 4157) no Hoare annotation was computed. [2019-11-19 21:48:40,227 INFO L440 ceAbstractionStarter]: At program point L4880(lines 4812 4883) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,227 INFO L440 ceAbstractionStarter]: At program point L3625(lines 3614 3630) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,227 INFO L444 ceAbstractionStarter]: For program point L4484(lines 4484 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,227 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:48:40,227 INFO L440 ceAbstractionStarter]: At program point L4485(lines 4484 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,227 INFO L444 ceAbstractionStarter]: For program point L4221(lines 4221 4255) no Hoare annotation was computed. [2019-11-19 21:48:40,227 INFO L440 ceAbstractionStarter]: At program point L3957(lines 3807 3962) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,228 INFO L444 ceAbstractionStarter]: For program point L4552(lines 4552 4558) no Hoare annotation was computed. [2019-11-19 21:48:40,228 INFO L440 ceAbstractionStarter]: At program point L4222(lines 4221 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,228 INFO L444 ceAbstractionStarter]: For program point L5015(lines 5015 5020) no Hoare annotation was computed. [2019-11-19 21:48:40,228 INFO L444 ceAbstractionStarter]: For program point L4024(lines 4024 4042) no Hoare annotation was computed. [2019-11-19 21:48:40,228 INFO L444 ceAbstractionStarter]: For program point L5015-2(lines 5015 5020) no Hoare annotation was computed. [2019-11-19 21:48:40,228 INFO L444 ceAbstractionStarter]: For program point L4817(lines 4817 4822) no Hoare annotation was computed. [2019-11-19 21:48:40,228 INFO L444 ceAbstractionStarter]: For program point L4487(lines 4487 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,228 INFO L440 ceAbstractionStarter]: At program point L5082(lines 5081 5083) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,228 INFO L444 ceAbstractionStarter]: For program point L3827(line 3827) no Hoare annotation was computed. [2019-11-19 21:48:40,228 INFO L440 ceAbstractionStarter]: At program point L4884(lines 4811 4885) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,229 INFO L440 ceAbstractionStarter]: At program point L4488(lines 4487 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,229 INFO L444 ceAbstractionStarter]: For program point L4158(lines 4158 4162) no Hoare annotation was computed. [2019-11-19 21:48:40,229 INFO L444 ceAbstractionStarter]: For program point L4158-2(lines 4158 4162) no Hoare annotation was computed. [2019-11-19 21:48:40,229 INFO L440 ceAbstractionStarter]: At program point L4026loopEntry(lines 4026 4036) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,229 INFO L444 ceAbstractionStarter]: For program point L4819(lines 4819 4822) no Hoare annotation was computed. [2019-11-19 21:48:40,229 INFO L444 ceAbstractionStarter]: For program point L3828(lines 3828 3834) no Hoare annotation was computed. [2019-11-19 21:48:40,229 INFO L444 ceAbstractionStarter]: For program point L4819-1(lines 4817 4822) no Hoare annotation was computed. [2019-11-19 21:48:40,229 INFO L444 ceAbstractionStarter]: For program point L4621(lines 4621 4624) no Hoare annotation was computed. [2019-11-19 21:48:40,229 INFO L444 ceAbstractionStarter]: For program point L4027(line 4027) no Hoare annotation was computed. [2019-11-19 21:48:40,230 INFO L440 ceAbstractionStarter]: At program point L4622(lines 4605 4635) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-19 21:48:40,230 INFO L444 ceAbstractionStarter]: For program point L4490(lines 4490 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,230 INFO L440 ceAbstractionStarter]: At program point L4292(lines 4282 4293) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,230 INFO L444 ceAbstractionStarter]: For program point L4028(lines 4028 4034) no Hoare annotation was computed. [2019-11-19 21:48:40,230 INFO L440 ceAbstractionStarter]: At program point L4491(lines 4490 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,230 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:48:40,230 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4901) no Hoare annotation was computed. [2019-11-19 21:48:40,231 INFO L440 ceAbstractionStarter]: At program point L3897(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,231 INFO L440 ceAbstractionStarter]: At program point L3700(lines 3688 3702) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,231 INFO L444 ceAbstractionStarter]: For program point L4493(lines 4493 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,231 INFO L444 ceAbstractionStarter]: For program point L4163(lines 4163 4167) no Hoare annotation was computed. [2019-11-19 21:48:40,231 INFO L444 ceAbstractionStarter]: For program point L4163-2(lines 4163 4167) no Hoare annotation was computed. [2019-11-19 21:48:40,231 INFO L440 ceAbstractionStarter]: At program point L4494(lines 4493 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,231 INFO L440 ceAbstractionStarter]: At program point L5089(lines 5088 5090) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,231 INFO L444 ceAbstractionStarter]: For program point L4826(lines 4826 4882) no Hoare annotation was computed. [2019-11-19 21:48:40,231 INFO L444 ceAbstractionStarter]: For program point L4496(lines 4496 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,232 INFO L440 ceAbstractionStarter]: At program point L4298(lines 4262 4300) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,232 INFO L444 ceAbstractionStarter]: For program point L3902(line 3902) no Hoare annotation was computed. [2019-11-19 21:48:40,232 INFO L440 ceAbstractionStarter]: At program point L4827(lines 4826 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,232 INFO L444 ceAbstractionStarter]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2019-11-19 21:48:40,232 INFO L440 ceAbstractionStarter]: At program point L4497(lines 4496 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,232 INFO L440 ceAbstractionStarter]: At program point L4365(lines 4301 4367) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,232 INFO L440 ceAbstractionStarter]: At program point L5092(lines 5091 5093) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,232 INFO L444 ceAbstractionStarter]: For program point L3903(lines 3903 3909) no Hoare annotation was computed. [2019-11-19 21:48:40,232 INFO L440 ceAbstractionStarter]: At program point L3837(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,233 INFO L444 ceAbstractionStarter]: For program point L4168(lines 4168 4172) no Hoare annotation was computed. [2019-11-19 21:48:40,233 INFO L444 ceAbstractionStarter]: For program point L4168-2(lines 4168 4172) no Hoare annotation was computed. [2019-11-19 21:48:40,233 INFO L447 ceAbstractionStarter]: At program point L4895(lines 4788 4897) the Hoare annotation is: true [2019-11-19 21:48:40,233 INFO L444 ceAbstractionStarter]: For program point L4829(lines 4829 4882) no Hoare annotation was computed. [2019-11-19 21:48:40,233 INFO L440 ceAbstractionStarter]: At program point L3640(lines 3633 3642) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,233 INFO L440 ceAbstractionStarter]: At program point L3640-1(lines 3633 3642) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,233 INFO L444 ceAbstractionStarter]: For program point L4499(lines 4499 4537) no Hoare annotation was computed. [2019-11-19 21:48:40,233 INFO L440 ceAbstractionStarter]: At program point L4037(lines 3970 4052) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,233 INFO L440 ceAbstractionStarter]: At program point L4830(lines 4829 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,233 INFO L440 ceAbstractionStarter]: At program point L4500(lines 4499 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,234 INFO L440 ceAbstractionStarter]: At program point L5096(lines 5095 5097) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,234 INFO L444 ceAbstractionStarter]: For program point L4898(lines 1 5145) no Hoare annotation was computed. [2019-11-19 21:48:40,234 INFO L447 ceAbstractionStarter]: At program point L4898-3(lines 5033 5050) the Hoare annotation is: true [2019-11-19 21:48:40,234 INFO L444 ceAbstractionStarter]: For program point L4898-1(lines 1 5145) no Hoare annotation was computed. [2019-11-19 21:48:40,234 INFO L444 ceAbstractionStarter]: For program point L4832(lines 4832 4882) no Hoare annotation was computed. [2019-11-19 21:48:40,234 INFO L444 ceAbstractionStarter]: For program point L4898-2(lines 5042 5047) no Hoare annotation was computed. [2019-11-19 21:48:40,234 INFO L440 ceAbstractionStarter]: At program point L4634(lines 4603 4636) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-19 21:48:40,234 INFO L440 ceAbstractionStarter]: At program point L4502(lines 4501 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,235 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4901) no Hoare annotation was computed. [2019-11-19 21:48:40,235 INFO L444 ceAbstractionStarter]: For program point L3842(line 3842) no Hoare annotation was computed. [2019-11-19 21:48:40,235 INFO L440 ceAbstractionStarter]: At program point L4833(lines 4832 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,235 INFO L444 ceAbstractionStarter]: For program point L4173(lines 4173 4177) no Hoare annotation was computed. [2019-11-19 21:48:40,235 INFO L444 ceAbstractionStarter]: For program point L4173-2(lines 4173 4177) no Hoare annotation was computed. [2019-11-19 21:48:40,235 INFO L444 ceAbstractionStarter]: For program point L3975(lines 3975 3978) no Hoare annotation was computed. [2019-11-19 21:48:40,235 INFO L444 ceAbstractionStarter]: For program point L3843(lines 3843 3849) no Hoare annotation was computed. [2019-11-19 21:48:40,235 INFO L444 ceAbstractionStarter]: For program point L4835(lines 4835 4882) no Hoare annotation was computed. [2019-11-19 21:48:40,236 INFO L444 ceAbstractionStarter]: For program point L4901-2(line 4901) no Hoare annotation was computed. [2019-11-19 21:48:40,236 INFO L444 ceAbstractionStarter]: For program point L4901-3(line 4901) no Hoare annotation was computed. [2019-11-19 21:48:40,236 INFO L444 ceAbstractionStarter]: For program point L4901(line 4901) no Hoare annotation was computed. [2019-11-19 21:48:40,236 INFO L444 ceAbstractionStarter]: For program point L4901-1(line 4901) no Hoare annotation was computed. [2019-11-19 21:48:40,236 INFO L440 ceAbstractionStarter]: At program point L5100(lines 5099 5101) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,236 INFO L440 ceAbstractionStarter]: At program point L4836(lines 4835 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,236 INFO L440 ceAbstractionStarter]: At program point L3912(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,236 INFO L444 ceAbstractionStarter]: For program point L4375(lines 4375 4378) no Hoare annotation was computed. [2019-11-19 21:48:40,237 INFO L440 ceAbstractionStarter]: At program point L4111-1(lines 4085 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,237 INFO L440 ceAbstractionStarter]: At program point L4111(lines 4085 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,237 INFO L444 ceAbstractionStarter]: For program point L4838(lines 4838 4882) no Hoare annotation was computed. [2019-11-19 21:48:40,237 INFO L440 ceAbstractionStarter]: At program point L3715-1(lines 3712 3717) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,237 INFO L440 ceAbstractionStarter]: At program point L3715(lines 3712 3717) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,237 INFO L444 ceAbstractionStarter]: For program point L4178(lines 4178 4182) no Hoare annotation was computed. [2019-11-19 21:48:40,237 INFO L444 ceAbstractionStarter]: For program point L4178-2(lines 4178 4182) no Hoare annotation was computed. [2019-11-19 21:48:40,237 INFO L440 ceAbstractionStarter]: At program point L4839(lines 4838 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,238 INFO L440 ceAbstractionStarter]: At program point L3650(lines 3644 3652) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,238 INFO L440 ceAbstractionStarter]: At program point L4114(lines 4054 4116) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,238 INFO L440 ceAbstractionStarter]: At program point L4114-1(lines 4054 4116) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,238 INFO L444 ceAbstractionStarter]: For program point L4379(lines 4379 4382) no Hoare annotation was computed. [2019-11-19 21:48:40,238 INFO L444 ceAbstractionStarter]: For program point L4379-2(lines 4379 4382) no Hoare annotation was computed. [2019-11-19 21:48:40,238 INFO L444 ceAbstractionStarter]: For program point L3917(line 3917) no Hoare annotation was computed. [2019-11-19 21:48:40,238 INFO L444 ceAbstractionStarter]: For program point L4578(lines 4578 4585) no Hoare annotation was computed. [2019-11-19 21:48:40,238 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:48:40,238 INFO L440 ceAbstractionStarter]: At program point L5107(lines 5106 5108) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,238 INFO L444 ceAbstractionStarter]: For program point L3918(lines 3918 3924) no Hoare annotation was computed. [2019-11-19 21:48:40,239 INFO L440 ceAbstractionStarter]: At program point L3852(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,239 INFO L444 ceAbstractionStarter]: For program point L4183(lines 4183 4187) no Hoare annotation was computed. [2019-11-19 21:48:40,239 INFO L444 ceAbstractionStarter]: For program point L4183-2(lines 4183 4187) no Hoare annotation was computed. [2019-11-19 21:48:40,239 INFO L440 ceAbstractionStarter]: At program point L4051(lines 3963 4053) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,239 INFO L447 ceAbstractionStarter]: At program point L4910(lines 4910 4911) the Hoare annotation is: true [2019-11-19 21:48:40,239 INFO L447 ceAbstractionStarter]: At program point L4910-1(lines 4910 4911) the Hoare annotation is: true [2019-11-19 21:48:40,239 INFO L440 ceAbstractionStarter]: At program point L3721-1(lines 3718 3723) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,239 INFO L440 ceAbstractionStarter]: At program point L3721(lines 3718 3723) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,240 INFO L440 ceAbstractionStarter]: At program point L3986loopEntry(lines 3986 3996) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,240 INFO L444 ceAbstractionStarter]: For program point L4383(lines 4383 4386) no Hoare annotation was computed. [2019-11-19 21:48:40,240 INFO L440 ceAbstractionStarter]: At program point L5110(lines 5109 5111) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,240 INFO L444 ceAbstractionStarter]: For program point L3987(line 3987) no Hoare annotation was computed. [2019-11-19 21:48:40,240 INFO L444 ceAbstractionStarter]: For program point L3988(lines 3988 3994) no Hoare annotation was computed. [2019-11-19 21:48:40,240 INFO L440 ceAbstractionStarter]: At program point L4583(lines 4456 4599) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-11-19 21:48:40,240 INFO L440 ceAbstractionStarter]: At program point L4253(lines 4223 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,240 INFO L444 ceAbstractionStarter]: For program point L3857(line 3857) no Hoare annotation was computed. [2019-11-19 21:48:40,241 INFO L440 ceAbstractionStarter]: At program point L4981loopEntry(lines 4981 4994) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,241 INFO L444 ceAbstractionStarter]: For program point L3858(lines 3858 3864) no Hoare annotation was computed. [2019-11-19 21:48:40,241 INFO L440 ceAbstractionStarter]: At program point L5114(lines 5113 5115) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,241 INFO L444 ceAbstractionStarter]: For program point L4057-1(lines 4057 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,241 INFO L444 ceAbstractionStarter]: For program point L4057(lines 4057 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,241 INFO L444 ceAbstractionStarter]: For program point L4982(line 4982) no Hoare annotation was computed. [2019-11-19 21:48:40,241 INFO L440 ceAbstractionStarter]: At program point L4322loopEntry(lines 4322 4337) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:48:40,241 INFO L440 ceAbstractionStarter]: At program point L4058(lines 4057 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,242 INFO L440 ceAbstractionStarter]: At program point L4058-1(lines 4057 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,242 INFO L444 ceAbstractionStarter]: For program point L4323(lines 4322 4337) no Hoare annotation was computed. [2019-11-19 21:48:40,242 INFO L440 ceAbstractionStarter]: At program point L3927(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,242 INFO L444 ceAbstractionStarter]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2019-11-19 21:48:40,242 INFO L444 ceAbstractionStarter]: For program point L4060(lines 4060 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,242 INFO L440 ceAbstractionStarter]: At program point L5117(lines 5116 5118) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,242 INFO L444 ceAbstractionStarter]: For program point L4060-1(lines 4060 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,242 INFO L440 ceAbstractionStarter]: At program point L4259(lines 4117 4261) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,243 INFO L440 ceAbstractionStarter]: At program point L4458loopEntry(lines 4458 4468) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,243 INFO L444 ceAbstractionStarter]: For program point L4326(line 4326) no Hoare annotation was computed. [2019-11-19 21:48:40,243 INFO L444 ceAbstractionStarter]: For program point L4987(lines 4987 4990) no Hoare annotation was computed. [2019-11-19 21:48:40,243 INFO L440 ceAbstractionStarter]: At program point L5053(lines 5052 5054) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,243 INFO L444 ceAbstractionStarter]: For program point L4459(line 4459) no Hoare annotation was computed. [2019-11-19 21:48:40,243 INFO L444 ceAbstractionStarter]: For program point L4063-1(lines 4063 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,243 INFO L444 ceAbstractionStarter]: For program point L4063(lines 4063 4113) no Hoare annotation was computed. [2019-11-19 21:48:40,243 INFO L440 ceAbstractionStarter]: At program point L3997(lines 3970 4052) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,243 INFO L444 ceAbstractionStarter]: For program point L4460(lines 4460 4466) no Hoare annotation was computed. [2019-11-19 21:48:40,244 INFO L440 ceAbstractionStarter]: At program point L4064(lines 4060 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,244 INFO L440 ceAbstractionStarter]: At program point L5121(lines 5120 5122) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-19 21:48:40,244 INFO L440 ceAbstractionStarter]: At program point L4064-1(lines 4060 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,244 INFO L444 ceAbstractionStarter]: For program point L3932(line 3932) no Hoare annotation was computed. [2019-11-19 21:48:40,244 INFO L440 ceAbstractionStarter]: At program point L4197(lines 4139 4198) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-19 21:48:40,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,264 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,276 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:48:40 BoogieIcfgContainer [2019-11-19 21:48:40,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:48:40,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:48:40,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:48:40,312 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:48:40,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:28" (3/4) ... [2019-11-19 21:48:40,319 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:48:40,371 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 132 nodes and edges [2019-11-19 21:48:40,374 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2019-11-19 21:48:40,378 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-11-19 21:48:40,381 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-19 21:48:40,384 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 21:48:40,388 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:48:40,391 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 21:48:40,394 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 21:48:40,440 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_coherent_state && \result == 0) && \result == 0) && ldv_urb_state == 0) || (((ldv_urb_state <= 1 && (!(\result == 0) || !(\result == 0))) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state) [2019-11-19 21:48:40,787 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:48:40,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:48:40,790 INFO L168 Benchmark]: Toolchain (without parser) took 18618.09 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 473.4 MB). Free memory was 956.3 MB in the beginning and 979.9 MB in the end (delta: -23.6 MB). Peak memory consumption was 449.9 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:40,794 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:48:40,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1671.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -74.7 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:40,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:40,796 INFO L168 Benchmark]: Boogie Preprocessor took 152.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:40,796 INFO L168 Benchmark]: RCFGBuilder took 3890.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.0 GB in the beginning and 949.6 MB in the end (delta: 55.5 MB). Peak memory consumption was 244.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:40,797 INFO L168 Benchmark]: TraceAbstraction took 12254.79 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 236.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -198.0 MB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:40,797 INFO L168 Benchmark]: Witness Printer took 476.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 979.9 MB in the end (delta: 167.6 MB). Peak memory consumption was 167.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:40,800 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1671.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -74.7 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 166.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 152.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3890.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.0 GB in the beginning and 949.6 MB in the end (delta: 55.5 MB). Peak memory consumption was 244.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12254.79 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 236.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -198.0 MB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. * Witness Printer took 476.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 979.9 MB in the end (delta: 167.6 MB). Peak memory consumption was 167.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 4215]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3712]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5006]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 5060]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4493]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3712]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 5006]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 4054]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3970]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5060]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 4026]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4054]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4826]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4503]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5036]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 1]: Loop Invariant [2019-11-19 21:48:40,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && (retval + 1 <= 0 || 0 < retval)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3811]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4457]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4212]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4458]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4981]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4490]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4501]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4487]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4603]: Loop Invariant [2019-11-19 21:48:40,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3633]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 3618]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3633]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3678]: Loop Invariant [2019-11-19 21:48:40,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,843 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,843 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,843 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 5033]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4060]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4060]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4262]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5109]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5131]: Loop Invariant [2019-11-19 21:48:40,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 5120]: Loop Invariant [2019-11-19 21:48:40,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 5139]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5095]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5106]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5139]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 4811]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5139]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4484]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5139]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4481]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4057]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4282]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4117]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4788]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4203]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4200]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3688]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 5081]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4057]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4322]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4605]: Loop Invariant [2019-11-19 21:48:40,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && (retval + 1 <= 0 || 0 < retval)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 4478]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4267]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4266]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5056]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3970]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3986]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5064]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4475]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3644]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4283]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4140]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4838]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4456]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 5127]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5116]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4321]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3614]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4002]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4835]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5091]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4078]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3718]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3718]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4499]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4221]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5113]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4078]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5135]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 4812]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3608]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4301]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4910]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4910]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5077]: Loop Invariant [2019-11-19 21:48:40,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,858 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:48:40,858 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 4075]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5099]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4075]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4832]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5088]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5052]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4829]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4849]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3963]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4139]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3667]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4496]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4976]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && \result == 0) && \result == 0) && ldv_urb_state == 0) || (((ldv_urb_state <= 1 && (!(\result == 0) || !(\result == 0))) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state) - InvariantResult [Line: 4218]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 275 locations, 4 error locations. Result: SAFE, OverallTime: 12.1s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, HoareTripleCheckerStatistics: 5782 SDtfs, 4682 SDslu, 7154 SDs, 0 SdLazy, 579 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2505occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 3552 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 894 NumberOfFragments, 1218 HoareAnnotationTreeSize, 128 FomulaSimplifications, 131401 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 128 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 68503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...