./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 fcb8e130 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 21:00:46,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 21:00:46,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 21:00:46,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 21:00:46,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 21:00:46,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 21:00:46,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 21:00:46,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 21:00:46,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 21:00:46,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 21:00:46,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 21:00:46,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 21:00:46,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 21:00:46,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 21:00:46,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 21:00:46,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 21:00:46,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 21:00:46,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 21:00:46,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 21:00:46,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 21:00:46,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 21:00:46,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 21:00:46,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 21:00:46,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 21:00:46,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 21:00:46,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 21:00:46,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 21:00:46,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 21:00:46,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 21:00:46,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 21:00:46,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 21:00:46,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 21:00:46,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 21:00:46,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 21:00:46,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 21:00:46,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 21:00:46,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 21:00:46,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 21:00:46,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 21:00:46,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 21:00:46,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 21:00:46,457 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 21:00:46,474 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 21:00:46,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 21:00:46,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 21:00:46,475 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 21:00:46,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 21:00:46,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 21:00:46,476 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 21:00:46,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 21:00:46,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 21:00:46,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 21:00:46,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 21:00:46,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 21:00:46,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 21:00:46,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 21:00:46,478 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 21:00:46,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 21:00:46,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 21:00:46,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 21:00:46,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 21:00:46,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:00:46,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 21:00:46,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 21:00:46,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 21:00:46,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 21:00:46,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 21:00:46,479 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 21:00:46,479 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 21:00:46,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 21:00:46,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 21:00:46,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 [2021-11-22 21:00:46,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 21:00:46,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 21:00:46,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 21:00:46,674 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 21:00:46,674 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 21:00:46,676 INFO L432 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 [2021-11-22 21:00:46,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71937d2a7/9882d6329ca74ea9b1e60c4bf449587a/FLAG316385858 [2021-11-22 21:00:47,290 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 21:00:47,290 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 [2021-11-22 21:00:47,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71937d2a7/9882d6329ca74ea9b1e60c4bf449587a/FLAG316385858 [2021-11-22 21:00:47,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71937d2a7/9882d6329ca74ea9b1e60c4bf449587a [2021-11-22 21:00:47,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 21:00:47,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 21:00:47,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 21:00:47,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 21:00:47,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 21:00:47,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:00:47" (1/1) ... [2021-11-22 21:00:47,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e2af62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:47, skipping insertion in model container [2021-11-22 21:00:47,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:00:47" (1/1) ... [2021-11-22 21:00:47,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 21:00:47,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:00:48,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2021-11-22 21:00:48,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:00:48,618 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 21:00:48,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2021-11-22 21:00:48,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:00:48,866 INFO L208 MainTranslator]: Completed translation [2021-11-22 21:00:48,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48 WrapperNode [2021-11-22 21:00:48,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 21:00:48,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 21:00:48,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 21:00:48,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 21:00:48,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:48,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:48,992 INFO L137 Inliner]: procedures = 81, calls = 494, calls flagged for inlining = 68, calls inlined = 66, statements flattened = 1904 [2021-11-22 21:00:48,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 21:00:48,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 21:00:48,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 21:00:48,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 21:00:48,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:48,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:49,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:49,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:49,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:49,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:49,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:49,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 21:00:49,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 21:00:49,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 21:00:49,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 21:00:49,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (1/1) ... [2021-11-22 21:00:49,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:00:49,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:00:49,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 21:00:49,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 21:00:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 21:00:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 21:00:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 21:00:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 21:00:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 21:00:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 21:00:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 21:00:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 21:00:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 21:00:49,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 21:00:49,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 21:00:49,451 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 21:00:49,466 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 21:00:49,481 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 21:00:49,484 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 21:00:49,486 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 21:00:49,488 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 21:00:49,502 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 21:00:50,316 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2021-11-22 21:00:50,317 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2021-11-22 21:00:50,317 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2021-11-22 21:00:50,317 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2021-11-22 21:00:50,317 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##339: assume false; [2021-11-22 21:00:50,317 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##340: assume !false; [2021-11-22 21:00:50,318 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2021-11-22 21:00:50,318 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2021-11-22 21:00:50,318 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2021-11-22 21:00:50,318 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2021-11-22 21:00:50,318 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 21:00:50,330 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 21:00:50,330 INFO L301 CfgBuilder]: Removed 24 assume(true) statements. [2021-11-22 21:00:50,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:00:50 BoogieIcfgContainer [2021-11-22 21:00:50,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 21:00:50,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 21:00:50,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 21:00:50,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 21:00:50,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:00:47" (1/3) ... [2021-11-22 21:00:50,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7a17f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:00:50, skipping insertion in model container [2021-11-22 21:00:50,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:00:48" (2/3) ... [2021-11-22 21:00:50,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7a17f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:00:50, skipping insertion in model container [2021-11-22 21:00:50,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:00:50" (3/3) ... [2021-11-22 21:00:50,338 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-11-22 21:00:50,341 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 21:00:50,341 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-22 21:00:50,375 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 21:00:50,383 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 21:00:50,384 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-22 21:00:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 290 states have (on average 1.5275862068965518) internal successors, (443), 294 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-22 21:00:50,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:50,407 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:00:50,407 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash 553199978, now seen corresponding path program 1 times [2021-11-22 21:00:50,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:50,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310184419] [2021-11-22 21:00:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:50,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:50,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:50,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310184419] [2021-11-22 21:00:50,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310184419] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:50,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:50,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:00:50,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817264963] [2021-11-22 21:00:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:50,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:00:50,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:50,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:00:50,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:00:50,871 INFO L87 Difference]: Start difference. First operand has 295 states, 290 states have (on average 1.5275862068965518) internal successors, (443), 294 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:51,163 INFO L93 Difference]: Finished difference Result 824 states and 1250 transitions. [2021-11-22 21:00:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:00:51,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-22 21:00:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:51,175 INFO L225 Difference]: With dead ends: 824 [2021-11-22 21:00:51,175 INFO L226 Difference]: Without dead ends: 522 [2021-11-22 21:00:51,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:00:51,180 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 343 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:51,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 1002 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:00:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-11-22 21:00:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 284. [2021-11-22 21:00:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 280 states have (on average 1.3464285714285715) internal successors, (377), 283 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 377 transitions. [2021-11-22 21:00:51,232 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 377 transitions. Word has length 13 [2021-11-22 21:00:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:51,232 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 377 transitions. [2021-11-22 21:00:51,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 377 transitions. [2021-11-22 21:00:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-22 21:00:51,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:51,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:00:51,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 21:00:51,233 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:51,233 INFO L85 PathProgramCache]: Analyzing trace with hash 160172968, now seen corresponding path program 1 times [2021-11-22 21:00:51,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:51,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125417545] [2021-11-22 21:00:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:51,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:51,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:51,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125417545] [2021-11-22 21:00:51,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125417545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:51,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:51,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 21:00:51,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539129359] [2021-11-22 21:00:51,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:51,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:00:51,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:00:51,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:00:51,408 INFO L87 Difference]: Start difference. First operand 284 states and 377 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:51,437 INFO L93 Difference]: Finished difference Result 815 states and 1090 transitions. [2021-11-22 21:00:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:00:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-22 21:00:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:51,444 INFO L225 Difference]: With dead ends: 815 [2021-11-22 21:00:51,446 INFO L226 Difference]: Without dead ends: 546 [2021-11-22 21:00:51,448 INFO L932 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 [2021-11-22 21:00:51,451 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 359 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:51,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 754 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:00:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-11-22 21:00:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2021-11-22 21:00:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 538 states have (on average 1.3494423791821561) internal successors, (726), 541 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 726 transitions. [2021-11-22 21:00:51,505 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 726 transitions. Word has length 13 [2021-11-22 21:00:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:51,505 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 726 transitions. [2021-11-22 21:00:51,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 726 transitions. [2021-11-22 21:00:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 21:00:51,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:51,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:00:51,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 21:00:51,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 670394211, now seen corresponding path program 1 times [2021-11-22 21:00:51,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:51,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235565878] [2021-11-22 21:00:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:51,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:51,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:51,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235565878] [2021-11-22 21:00:51,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235565878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:51,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:51,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 21:00:51,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649387802] [2021-11-22 21:00:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:51,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:00:51,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:51,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:00:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:00:51,666 INFO L87 Difference]: Start difference. First operand 542 states and 726 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:51,679 INFO L93 Difference]: Finished difference Result 542 states and 726 transitions. [2021-11-22 21:00:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:00:51,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-22 21:00:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:51,681 INFO L225 Difference]: With dead ends: 542 [2021-11-22 21:00:51,681 INFO L226 Difference]: Without dead ends: 533 [2021-11-22 21:00:51,685 INFO L932 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 [2021-11-22 21:00:51,687 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 363 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:51,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:00:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-11-22 21:00:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2021-11-22 21:00:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 530 states have (on average 1.3471698113207546) internal successors, (714), 532 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 714 transitions. [2021-11-22 21:00:51,741 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 714 transitions. Word has length 14 [2021-11-22 21:00:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:51,742 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 714 transitions. [2021-11-22 21:00:51,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 714 transitions. [2021-11-22 21:00:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 21:00:51,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:51,752 INFO L514 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] [2021-11-22 21:00:51,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 21:00:51,753 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1273157654, now seen corresponding path program 1 times [2021-11-22 21:00:51,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:51,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715044936] [2021-11-22 21:00:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:51,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:51,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:51,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715044936] [2021-11-22 21:00:51,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715044936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:51,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:51,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:00:51,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326701029] [2021-11-22 21:00:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:51,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:00:51,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:00:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:00:51,933 INFO L87 Difference]: Start difference. First operand 533 states and 714 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:52,121 INFO L93 Difference]: Finished difference Result 1510 states and 2043 transitions. [2021-11-22 21:00:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:00:52,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-22 21:00:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:52,124 INFO L225 Difference]: With dead ends: 1510 [2021-11-22 21:00:52,124 INFO L226 Difference]: Without dead ends: 992 [2021-11-22 21:00:52,125 INFO L932 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 [2021-11-22 21:00:52,125 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 316 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:52,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 965 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:00:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-11-22 21:00:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 977. [2021-11-22 21:00:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 974 states have (on average 1.3665297741273101) internal successors, (1331), 976 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1331 transitions. [2021-11-22 21:00:52,164 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1331 transitions. Word has length 52 [2021-11-22 21:00:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:52,165 INFO L470 AbstractCegarLoop]: Abstraction has 977 states and 1331 transitions. [2021-11-22 21:00:52,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1331 transitions. [2021-11-22 21:00:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 21:00:52,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:52,169 INFO L514 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] [2021-11-22 21:00:52,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 21:00:52,170 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1345544212, now seen corresponding path program 1 times [2021-11-22 21:00:52,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:52,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37421537] [2021-11-22 21:00:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:52,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:52,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:52,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37421537] [2021-11-22 21:00:52,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37421537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:52,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:52,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 21:00:52,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333475544] [2021-11-22 21:00:52,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:52,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 21:00:52,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:52,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 21:00:52,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:00:52,355 INFO L87 Difference]: Start difference. First operand 977 states and 1331 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:52,566 INFO L93 Difference]: Finished difference Result 6062 states and 8254 transitions. [2021-11-22 21:00:52,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 21:00:52,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-22 21:00:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:52,583 INFO L225 Difference]: With dead ends: 6062 [2021-11-22 21:00:52,583 INFO L226 Difference]: Without dead ends: 5573 [2021-11-22 21:00:52,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 21:00:52,586 INFO L933 BasicCegarLoop]: 903 mSDtfsCounter, 1981 mSDsluCounter, 2535 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:52,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1981 Valid, 3438 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:00:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2021-11-22 21:00:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 989. [2021-11-22 21:00:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 986 states have (on average 1.3620689655172413) internal successors, (1343), 988 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1343 transitions. [2021-11-22 21:00:52,653 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1343 transitions. Word has length 52 [2021-11-22 21:00:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:52,653 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1343 transitions. [2021-11-22 21:00:52,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1343 transitions. [2021-11-22 21:00:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 21:00:52,654 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:52,654 INFO L514 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] [2021-11-22 21:00:52,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 21:00:52,655 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash -334426962, now seen corresponding path program 1 times [2021-11-22 21:00:52,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:52,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114323317] [2021-11-22 21:00:52,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:52,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:52,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114323317] [2021-11-22 21:00:52,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114323317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:52,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:52,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 21:00:52,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479069319] [2021-11-22 21:00:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:52,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:00:52,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:52,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:00:52,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:00:52,824 INFO L87 Difference]: Start difference. First operand 989 states and 1343 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:53,002 INFO L93 Difference]: Finished difference Result 3090 states and 4219 transitions. [2021-11-22 21:00:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:00:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-22 21:00:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:53,009 INFO L225 Difference]: With dead ends: 3090 [2021-11-22 21:00:53,009 INFO L226 Difference]: Without dead ends: 2116 [2021-11-22 21:00:53,011 INFO L932 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 [2021-11-22 21:00:53,012 INFO L933 BasicCegarLoop]: 682 mSDtfsCounter, 735 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:53,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [735 Valid, 1718 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:00:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2021-11-22 21:00:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 961. [2021-11-22 21:00:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 958 states have (on average 1.3622129436325678) internal successors, (1305), 960 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1305 transitions. [2021-11-22 21:00:53,081 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1305 transitions. Word has length 52 [2021-11-22 21:00:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:53,081 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1305 transitions. [2021-11-22 21:00:53,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1305 transitions. [2021-11-22 21:00:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 21:00:53,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:53,083 INFO L514 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] [2021-11-22 21:00:53,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 21:00:53,083 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1361075182, now seen corresponding path program 1 times [2021-11-22 21:00:53,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:53,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498917848] [2021-11-22 21:00:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:53,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:53,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:53,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498917848] [2021-11-22 21:00:53,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498917848] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:53,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:53,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 21:00:53,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826082262] [2021-11-22 21:00:53,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:53,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 21:00:53,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:53,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 21:00:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 21:00:53,263 INFO L87 Difference]: Start difference. First operand 961 states and 1305 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:53,643 INFO L93 Difference]: Finished difference Result 3809 states and 5142 transitions. [2021-11-22 21:00:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 21:00:53,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-22 21:00:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:53,653 INFO L225 Difference]: With dead ends: 3809 [2021-11-22 21:00:53,653 INFO L226 Difference]: Without dead ends: 3310 [2021-11-22 21:00:53,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-22 21:00:53,655 INFO L933 BasicCegarLoop]: 1037 mSDtfsCounter, 1920 mSDsluCounter, 3112 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1920 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:53,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1920 Valid, 4149 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:00:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2021-11-22 21:00:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 965. [2021-11-22 21:00:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 962 states have (on average 1.3607068607068606) internal successors, (1309), 964 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1309 transitions. [2021-11-22 21:00:53,716 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1309 transitions. Word has length 52 [2021-11-22 21:00:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:53,716 INFO L470 AbstractCegarLoop]: Abstraction has 965 states and 1309 transitions. [2021-11-22 21:00:53,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1309 transitions. [2021-11-22 21:00:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 21:00:53,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:53,717 INFO L514 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] [2021-11-22 21:00:53,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 21:00:53,718 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:53,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash 660010604, now seen corresponding path program 1 times [2021-11-22 21:00:53,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:53,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889488364] [2021-11-22 21:00:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:53,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:53,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:53,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889488364] [2021-11-22 21:00:53,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889488364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:53,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:53,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:00:53,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658736686] [2021-11-22 21:00:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:53,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:00:53,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:53,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:00:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:00:53,817 INFO L87 Difference]: Start difference. First operand 965 states and 1309 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:53,943 INFO L93 Difference]: Finished difference Result 1465 states and 1987 transitions. [2021-11-22 21:00:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:00:53,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-22 21:00:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:53,947 INFO L225 Difference]: With dead ends: 1465 [2021-11-22 21:00:53,947 INFO L226 Difference]: Without dead ends: 1461 [2021-11-22 21:00:53,948 INFO L932 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 [2021-11-22 21:00:53,948 INFO L933 BasicCegarLoop]: 679 mSDtfsCounter, 629 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:53,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 1391 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:00:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2021-11-22 21:00:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1453. [2021-11-22 21:00:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1450 states have (on average 1.3620689655172413) internal successors, (1975), 1452 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1975 transitions. [2021-11-22 21:00:54,019 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1975 transitions. Word has length 52 [2021-11-22 21:00:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:54,020 INFO L470 AbstractCegarLoop]: Abstraction has 1453 states and 1975 transitions. [2021-11-22 21:00:54,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1975 transitions. [2021-11-22 21:00:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 21:00:54,021 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:54,021 INFO L514 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] [2021-11-22 21:00:54,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 21:00:54,021 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash 17435025, now seen corresponding path program 1 times [2021-11-22 21:00:54,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:54,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061757430] [2021-11-22 21:00:54,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:54,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:54,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:54,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061757430] [2021-11-22 21:00:54,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061757430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:54,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:54,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 21:00:54,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543706051] [2021-11-22 21:00:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:54,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 21:00:54,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 21:00:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:00:54,120 INFO L87 Difference]: Start difference. First operand 1453 states and 1975 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:54,527 INFO L93 Difference]: Finished difference Result 5930 states and 8099 transitions. [2021-11-22 21:00:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 21:00:54,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-22 21:00:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:54,539 INFO L225 Difference]: With dead ends: 5930 [2021-11-22 21:00:54,540 INFO L226 Difference]: Without dead ends: 4492 [2021-11-22 21:00:54,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-22 21:00:54,543 INFO L933 BasicCegarLoop]: 1269 mSDtfsCounter, 1753 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 4652 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:54,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1753 Valid, 4652 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:00:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2021-11-22 21:00:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 1447. [2021-11-22 21:00:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1444 states have (on average 1.3566481994459834) internal successors, (1959), 1446 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1959 transitions. [2021-11-22 21:00:54,646 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1959 transitions. Word has length 53 [2021-11-22 21:00:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:54,647 INFO L470 AbstractCegarLoop]: Abstraction has 1447 states and 1959 transitions. [2021-11-22 21:00:54,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1959 transitions. [2021-11-22 21:00:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 21:00:54,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:54,648 INFO L514 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] [2021-11-22 21:00:54,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 21:00:54,649 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:54,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1798183777, now seen corresponding path program 1 times [2021-11-22 21:00:54,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:54,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254868991] [2021-11-22 21:00:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:54,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:54,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:54,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254868991] [2021-11-22 21:00:54,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254868991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:54,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:54,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:00:54,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769959207] [2021-11-22 21:00:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:54,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:00:54,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:00:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:00:54,750 INFO L87 Difference]: Start difference. First operand 1447 states and 1959 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:55,085 INFO L93 Difference]: Finished difference Result 6504 states and 8817 transitions. [2021-11-22 21:00:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:00:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-22 21:00:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:55,100 INFO L225 Difference]: With dead ends: 6504 [2021-11-22 21:00:55,101 INFO L226 Difference]: Without dead ends: 5072 [2021-11-22 21:00:55,104 INFO L932 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 [2021-11-22 21:00:55,104 INFO L933 BasicCegarLoop]: 666 mSDtfsCounter, 882 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:55,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [882 Valid, 1593 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:00:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2021-11-22 21:00:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 2777. [2021-11-22 21:00:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2774 states have (on average 1.3511175198269647) internal successors, (3748), 2776 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3748 transitions. [2021-11-22 21:00:55,285 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3748 transitions. Word has length 63 [2021-11-22 21:00:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:55,286 INFO L470 AbstractCegarLoop]: Abstraction has 2777 states and 3748 transitions. [2021-11-22 21:00:55,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3748 transitions. [2021-11-22 21:00:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 21:00:55,287 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:55,288 INFO L514 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] [2021-11-22 21:00:55,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 21:00:55,288 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash 115752283, now seen corresponding path program 1 times [2021-11-22 21:00:55,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:55,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383757500] [2021-11-22 21:00:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:55,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:55,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:55,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383757500] [2021-11-22 21:00:55,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383757500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:55,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:55,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:00:55,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229010016] [2021-11-22 21:00:55,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:55,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:00:55,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:55,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:00:55,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:00:55,382 INFO L87 Difference]: Start difference. First operand 2777 states and 3748 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:55,666 INFO L93 Difference]: Finished difference Result 5463 states and 7347 transitions. [2021-11-22 21:00:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:00:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-22 21:00:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:55,673 INFO L225 Difference]: With dead ends: 5463 [2021-11-22 21:00:55,673 INFO L226 Difference]: Without dead ends: 2701 [2021-11-22 21:00:55,676 INFO L932 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 [2021-11-22 21:00:55,676 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 281 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:55,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 971 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:00:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2021-11-22 21:00:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2663. [2021-11-22 21:00:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2660 states have (on average 1.343609022556391) internal successors, (3574), 2662 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3574 transitions. [2021-11-22 21:00:55,834 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3574 transitions. Word has length 63 [2021-11-22 21:00:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:55,834 INFO L470 AbstractCegarLoop]: Abstraction has 2663 states and 3574 transitions. [2021-11-22 21:00:55,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3574 transitions. [2021-11-22 21:00:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 21:00:55,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:55,836 INFO L514 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, 1, 1, 1] [2021-11-22 21:00:55,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 21:00:55,836 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2085548327, now seen corresponding path program 1 times [2021-11-22 21:00:55,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:55,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664646990] [2021-11-22 21:00:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:55,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:56,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:56,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664646990] [2021-11-22 21:00:56,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664646990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:56,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:56,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 21:00:56,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363308561] [2021-11-22 21:00:56,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:56,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 21:00:56,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 21:00:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-22 21:00:56,008 INFO L87 Difference]: Start difference. First operand 2663 states and 3574 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:56,524 INFO L93 Difference]: Finished difference Result 4647 states and 6223 transitions. [2021-11-22 21:00:56,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 21:00:56,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 21:00:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:56,542 INFO L225 Difference]: With dead ends: 4647 [2021-11-22 21:00:56,542 INFO L226 Difference]: Without dead ends: 2813 [2021-11-22 21:00:56,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-11-22 21:00:56,546 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 2320 mSDsluCounter, 3002 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:56,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2320 Valid, 4116 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:00:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2021-11-22 21:00:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 1843. [2021-11-22 21:00:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1840 states have (on average 1.3304347826086957) internal successors, (2448), 1842 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2448 transitions. [2021-11-22 21:00:56,698 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2448 transitions. Word has length 71 [2021-11-22 21:00:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:56,698 INFO L470 AbstractCegarLoop]: Abstraction has 1843 states and 2448 transitions. [2021-11-22 21:00:56,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2448 transitions. [2021-11-22 21:00:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 21:00:56,703 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:56,703 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-22 21:00:56,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 21:00:56,703 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1867136172, now seen corresponding path program 1 times [2021-11-22 21:00:56,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:56,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089024331] [2021-11-22 21:00:56,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:56,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 21:00:56,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:56,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089024331] [2021-11-22 21:00:56,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089024331] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:56,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:56,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 21:00:56,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129488330] [2021-11-22 21:00:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:56,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 21:00:56,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:56,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 21:00:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:00:56,859 INFO L87 Difference]: Start difference. First operand 1843 states and 2448 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:57,006 INFO L93 Difference]: Finished difference Result 3673 states and 4881 transitions. [2021-11-22 21:00:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:00:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-22 21:00:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:57,010 INFO L225 Difference]: With dead ends: 3673 [2021-11-22 21:00:57,010 INFO L226 Difference]: Without dead ends: 1840 [2021-11-22 21:00:57,013 INFO L932 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 [2021-11-22 21:00:57,013 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 5 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:57,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1464 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:00:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2021-11-22 21:00:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2021-11-22 21:00:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1837 states have (on average 1.3298856831790964) internal successors, (2443), 1839 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2443 transitions. [2021-11-22 21:00:57,153 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2443 transitions. Word has length 73 [2021-11-22 21:00:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:57,154 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2443 transitions. [2021-11-22 21:00:57,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2443 transitions. [2021-11-22 21:00:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-22 21:00:57,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:57,156 INFO L514 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:00:57,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 21:00:57,156 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 21:00:57,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash 459858806, now seen corresponding path program 1 times [2021-11-22 21:00:57,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:00:57,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334715353] [2021-11-22 21:00:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:57,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:00:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 21:00:57,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:00:57,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334715353] [2021-11-22 21:00:57,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334715353] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:00:57,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:00:57,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:00:57,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139979063] [2021-11-22 21:00:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:00:57,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:00:57,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:00:57,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:00:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:00:57,301 INFO L87 Difference]: Start difference. First operand 1840 states and 2443 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:00:57,437 INFO L93 Difference]: Finished difference Result 1840 states and 2443 transitions. [2021-11-22 21:00:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:00:57,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-22 21:00:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:00:57,438 INFO L225 Difference]: With dead ends: 1840 [2021-11-22 21:00:57,439 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 21:00:57,441 INFO L932 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 [2021-11-22 21:00:57,441 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 289 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:00:57,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 711 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:00:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 21:00:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 21:00:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 21:00:57,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-11-22 21:00:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:00:57,443 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 21:00:57,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:00:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 21:00:57,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 21:00:57,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-11-22 21:00:57,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2021-11-22 21:00:57,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2021-11-22 21:00:57,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2021-11-22 21:00:57,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 21:00:57,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 21:02:15,431 INFO L858 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-11-22 21:02:15,432 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-22 21:02:15,433 INFO L854 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,433 INFO L854 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,433 INFO L858 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-11-22 21:02:15,433 INFO L854 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,433 INFO L858 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-11-22 21:02:15,433 INFO L858 garLoopResultBuilder]: For program point L4860(lines 4860 4863) no Hoare annotation was computed. [2021-11-22 21:02:15,447 INFO L858 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,447 INFO L854 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,447 INFO L858 garLoopResultBuilder]: For program point L4068-1(lines 4068 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,448 INFO L858 garLoopResultBuilder]: For program point L4993(line 4993) no Hoare annotation was computed. [2021-11-22 21:02:15,448 INFO L854 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,448 INFO L854 garLoopResultBuilder]: At program point L4069-1(lines 4068 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,448 INFO L854 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,448 INFO L858 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-11-22 21:02:15,448 INFO L854 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,448 INFO L858 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-11-22 21:02:15,448 INFO L858 garLoopResultBuilder]: For program point L4071-1(lines 4071 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,463 INFO L858 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,463 INFO L854 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,463 INFO L854 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,464 INFO L854 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,465 INFO L858 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-11-22 21:02:15,465 INFO L858 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-11-22 21:02:15,465 INFO L854 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,466 INFO L858 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-11-22 21:02:15,466 INFO L858 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,466 INFO L854 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,466 INFO L858 garLoopResultBuilder]: For program point L4074-1(lines 4074 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,466 INFO L858 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-11-22 21:02:15,466 INFO L854 garLoopResultBuilder]: At program point L4075-1(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,466 INFO L854 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,466 INFO L854 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-22 21:02:15,466 INFO L858 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-11-22 21:02:15,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-22 21:02:15,467 INFO L854 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,467 INFO L858 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-11-22 21:02:15,467 INFO L854 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,467 INFO L854 garLoopResultBuilder]: At program point L4605(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,468 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-11-22 21:02:15,468 INFO L858 garLoopResultBuilder]: For program point L4077-1(lines 4077 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,468 INFO L858 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,468 INFO L854 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,468 INFO L858 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-11-22 21:02:15,468 INFO L854 garLoopResultBuilder]: At program point L5136(lines 5135 5137) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-11-22 21:02:15,468 INFO L854 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,468 INFO L854 garLoopResultBuilder]: At program point L4410(lines 4379 4412) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,469 INFO L854 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,469 INFO L854 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,469 INFO L858 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,469 INFO L858 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-11-22 21:02:15,469 INFO L858 garLoopResultBuilder]: For program point L4080-1(lines 4080 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,469 INFO L854 garLoopResultBuilder]: At program point L4609(lines 4458 4611) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) (.cse5 (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0)) (.cse6 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse8 (+ |ULTIMATE.start_usb_free_urb_~urb#1.offset| |ULTIMATE.start_usb_free_urb_~urb#1.base|))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) .cse5 (= |ULTIMATE.start_usb_free_urb_~urb#1.offset| 0) .cse6))) [2021-11-22 21:02:15,469 INFO L858 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-11-22 21:02:15,469 INFO L854 garLoopResultBuilder]: At program point L4081-1(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,469 INFO L854 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,470 INFO L858 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-11-22 21:02:15,470 INFO L858 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-11-22 21:02:15,470 INFO L858 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-11-22 21:02:15,470 INFO L854 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,470 INFO L858 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-11-22 21:02:15,470 INFO L858 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-11-22 21:02:15,470 INFO L854 garLoopResultBuilder]: At program point L5139(lines 5138 5140) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (or (<= (+ |ULTIMATE.start_ir_init_~retval~0#1| 1) 0) (< 0 |ULTIMATE.start_ir_init_~retval~0#1|)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-11-22 21:02:15,470 INFO L854 garLoopResultBuilder]: At program point L5139-1(lines 5138 5140) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-22 21:02:15,470 INFO L858 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-11-22 21:02:15,470 INFO L858 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-11-22 21:02:15,471 INFO L858 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-11-22 21:02:15,471 INFO L854 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,471 INFO L858 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-11-22 21:02:15,471 INFO L858 garLoopResultBuilder]: For program point L4083-1(lines 4083 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,471 INFO L858 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,471 INFO L858 garLoopResultBuilder]: For program point L5074-4(line 5074) no Hoare annotation was computed. [2021-11-22 21:02:15,471 INFO L858 garLoopResultBuilder]: For program point L5074-2(line 5074) no Hoare annotation was computed. [2021-11-22 21:02:15,471 INFO L858 garLoopResultBuilder]: For program point L5074-6(line 5074) no Hoare annotation was computed. [2021-11-22 21:02:15,471 INFO L854 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,471 INFO L854 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,472 INFO L854 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,472 INFO L854 garLoopResultBuilder]: At program point L5075(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,472 INFO L854 garLoopResultBuilder]: At program point L5075-1(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,473 INFO L854 garLoopResultBuilder]: At program point L4084-1(lines 4083 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,473 INFO L854 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (.cse0 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse4 (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|)) (.cse5 (= ~ldv_urb_state~0 0)) (.cse6 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) (.cse7 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (<= 1 ~ldv_urb_state~0) .cse2 .cse4 .cse6 (not .cse1) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0)) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not .cse3) .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse9 (+ |ULTIMATE.start_usb_free_urb_~urb#1.offset| |ULTIMATE.start_usb_free_urb_~urb#1.base|))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) (= |ULTIMATE.start_usb_free_urb_~urb#1.offset| 0) .cse7))) [2021-11-22 21:02:15,473 INFO L854 garLoopResultBuilder]: At program point L5075-2(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,473 INFO L854 garLoopResultBuilder]: At program point L5075-3(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,473 INFO L854 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,473 INFO L854 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,473 INFO L858 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-11-22 21:02:15,473 INFO L854 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,473 INFO L854 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,474 INFO L854 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,474 INFO L854 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,474 INFO L858 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-11-22 21:02:15,474 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,474 INFO L858 garLoopResultBuilder]: For program point L4086-1(lines 4086 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,474 INFO L854 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,475 INFO L858 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-11-22 21:02:15,475 INFO L858 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-11-22 21:02:15,475 INFO L854 garLoopResultBuilder]: At program point L5078(lines 5077 5079) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,475 INFO L858 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-11-22 21:02:15,475 INFO L854 garLoopResultBuilder]: At program point L4087-1(lines 4086 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,475 INFO L854 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,475 INFO L854 garLoopResultBuilder]: At program point L5078-1(lines 5077 5079) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,475 INFO L858 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-11-22 21:02:15,475 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L854 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L4089-1(lines 4089 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,476 INFO L858 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,477 INFO L854 garLoopResultBuilder]: At program point L5147(lines 5146 5148) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-11-22 21:02:15,477 INFO L854 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,477 INFO L854 garLoopResultBuilder]: At program point L4090-1(lines 4089 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,477 INFO L858 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-11-22 21:02:15,477 INFO L858 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-11-22 21:02:15,477 INFO L854 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,478 INFO L858 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-11-22 21:02:15,478 INFO L854 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,478 INFO L854 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,478 INFO L858 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-11-22 21:02:15,478 INFO L854 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,478 INFO L854 garLoopResultBuilder]: At program point L3695(lines 3689 3697) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-11-22 21:02:15,478 INFO L854 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,478 INFO L854 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,480 INFO L858 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,480 INFO L858 garLoopResultBuilder]: For program point L4092-1(lines 4092 4124) no Hoare annotation was computed. [2021-11-22 21:02:15,480 INFO L854 garLoopResultBuilder]: At program point L5017-2loopEntry(lines 5017 5036) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= |ULTIMATE.start_usb_free_urb_~urb#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,480 INFO L854 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= |ULTIMATE.start_usb_free_urb_~urb#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,480 INFO L858 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-11-22 21:02:15,481 INFO L858 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,481 INFO L858 garLoopResultBuilder]: For program point L4357-2(lines 4357 4367) no Hoare annotation was computed. [2021-11-22 21:02:15,481 INFO L858 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-11-22 21:02:15,481 INFO L858 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-11-22 21:02:15,481 INFO L854 garLoopResultBuilder]: At program point L4093-1(lines 4092 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,481 INFO L854 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1 (= |ULTIMATE.start_ir_xbof_change_~xbof___0#1| 0)) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,482 INFO L858 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-11-22 21:02:15,482 INFO L858 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-11-22 21:02:15,482 INFO L858 garLoopResultBuilder]: For program point L5018-1(lines 5017 5036) no Hoare annotation was computed. [2021-11-22 21:02:15,482 INFO L854 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,482 INFO L858 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-11-22 21:02:15,482 INFO L854 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,482 INFO L858 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-11-22 21:02:15,483 INFO L858 garLoopResultBuilder]: For program point L5019-1(lines 5017 5036) no Hoare annotation was computed. [2021-11-22 21:02:15,483 INFO L854 garLoopResultBuilder]: At program point L5085(lines 5084 5086) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,483 INFO L854 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,483 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 21:02:15,483 INFO L854 garLoopResultBuilder]: At program point L4095-1(lines 4094 4124) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,483 INFO L854 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,483 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-22 21:02:15,483 INFO L858 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,483 INFO L854 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,484 INFO L858 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-11-22 21:02:15,484 INFO L858 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-11-22 21:02:15,484 INFO L854 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,484 INFO L858 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-11-22 21:02:15,484 INFO L858 garLoopResultBuilder]: For program point L5154(lines 5154 5156) no Hoare annotation was computed. [2021-11-22 21:02:15,484 INFO L858 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-11-22 21:02:15,484 INFO L858 garLoopResultBuilder]: For program point L5154-1(lines 5154 5156) no Hoare annotation was computed. [2021-11-22 21:02:15,484 INFO L858 garLoopResultBuilder]: For program point L5154-2(lines 5154 5156) no Hoare annotation was computed. [2021-11-22 21:02:15,484 INFO L858 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-11-22 21:02:15,484 INFO L854 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,485 INFO L858 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-11-22 21:02:15,485 INFO L854 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,485 INFO L858 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-11-22 21:02:15,485 INFO L858 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-11-22 21:02:15,485 INFO L858 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-11-22 21:02:15,485 INFO L854 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,485 INFO L854 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,485 INFO L858 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,485 INFO L854 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,485 INFO L858 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-11-22 21:02:15,486 INFO L854 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,486 INFO L858 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-11-22 21:02:15,486 INFO L854 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,486 INFO L858 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-11-22 21:02:15,486 INFO L854 garLoopResultBuilder]: At program point L5092(lines 5091 5093) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,486 INFO L858 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-11-22 21:02:15,486 INFO L858 garLoopResultBuilder]: For program point L5026-3(lines 5026 5031) no Hoare annotation was computed. [2021-11-22 21:02:15,486 INFO L858 garLoopResultBuilder]: For program point L5026-2(lines 5026 5031) no Hoare annotation was computed. [2021-11-22 21:02:15,486 INFO L858 garLoopResultBuilder]: For program point L5026-5(lines 5026 5031) no Hoare annotation was computed. [2021-11-22 21:02:15,488 INFO L858 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-11-22 21:02:15,488 INFO L858 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,488 INFO L854 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-22 21:02:15,488 INFO L858 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-11-22 21:02:15,488 INFO L854 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,488 INFO L858 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-11-22 21:02:15,488 INFO L858 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-11-22 21:02:15,488 INFO L854 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,488 INFO L858 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-11-22 21:02:15,488 INFO L858 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-11-22 21:02:15,489 INFO L858 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-11-22 21:02:15,489 INFO L858 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-11-22 21:02:15,489 INFO L854 garLoopResultBuilder]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-11-22 21:02:15,489 INFO L858 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-11-22 21:02:15,489 INFO L854 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (or (<= (+ |ULTIMATE.start_ir_init_~retval~0#1| 1) 0) (< 0 |ULTIMATE.start_ir_init_~retval~0#1|)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-11-22 21:02:15,489 INFO L858 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,489 INFO L854 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,489 INFO L858 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-11-22 21:02:15,489 INFO L854 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-22 21:02:15,490 INFO L854 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,490 INFO L854 garLoopResultBuilder]: At program point L5098(lines 5097 5099) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) (.cse4 (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0)) (.cse5 (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) (not .cse5)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-11-22 21:02:15,490 INFO L854 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,490 INFO L858 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,490 INFO L858 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-11-22 21:02:15,490 INFO L858 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-11-22 21:02:15,490 INFO L854 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,490 INFO L854 garLoopResultBuilder]: At program point L4902(lines 4811 4907) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-22 21:02:15,491 INFO L858 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-11-22 21:02:15,491 INFO L858 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,491 INFO L854 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,491 INFO L854 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,491 INFO L858 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-11-22 21:02:15,491 INFO L858 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-11-22 21:02:15,491 INFO L854 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,491 INFO L854 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,491 INFO L854 garLoopResultBuilder]: At program point L5037(lines 5013 5042) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (let ((.cse1 (+ |ULTIMATE.start_usb_free_urb_~urb#1.offset| |ULTIMATE.start_usb_free_urb_~urb#1.base|))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= |ULTIMATE.start_usb_free_urb_~urb#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,492 INFO L858 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-11-22 21:02:15,492 INFO L854 garLoopResultBuilder]: At program point L5037-1(lines 5013 5042) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (let ((.cse1 (+ |ULTIMATE.start_usb_free_urb_~urb#1.offset| |ULTIMATE.start_usb_free_urb_~urb#1.base|))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= |ULTIMATE.start_usb_free_urb_~urb#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,492 INFO L854 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,492 INFO L858 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-11-22 21:02:15,492 INFO L858 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-11-22 21:02:15,492 INFO L861 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-11-22 21:02:15,492 INFO L858 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-11-22 21:02:15,492 INFO L854 garLoopResultBuilder]: At program point L3651-1(lines 3644 3653) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,492 INFO L854 garLoopResultBuilder]: At program point L3651(lines 3644 3653) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,492 INFO L858 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-11-22 21:02:15,493 INFO L854 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,493 INFO L854 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,493 INFO L854 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,493 INFO L854 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,493 INFO L854 garLoopResultBuilder]: At program point L4644(lines 4616 4646) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (or (<= (+ |ULTIMATE.start_ir_init_~retval~0#1| 1) 0) (< 0 |ULTIMATE.start_ir_init_~retval~0#1|)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-11-22 21:02:15,493 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 21:02:15,493 INFO L858 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-11-22 21:02:15,493 INFO L858 garLoopResultBuilder]: For program point L4909-2(lines 4909 4914) no Hoare annotation was computed. [2021-11-22 21:02:15,493 INFO L858 garLoopResultBuilder]: For program point L4909-3(lines 4909 4914) no Hoare annotation was computed. [2021-11-22 21:02:15,494 INFO L858 garLoopResultBuilder]: For program point L4909(lines 4909 4914) no Hoare annotation was computed. [2021-11-22 21:02:15,494 INFO L858 garLoopResultBuilder]: For program point L4909-1(lines 4909 4914) no Hoare annotation was computed. [2021-11-22 21:02:15,494 INFO L854 garLoopResultBuilder]: At program point L4645(lines 4614 4647) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-11-22 21:02:15,494 INFO L854 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,494 INFO L854 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,494 INFO L858 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-11-22 21:02:15,494 INFO L854 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,494 INFO L858 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-11-22 21:02:15,494 INFO L858 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-11-22 21:02:15,494 INFO L858 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-11-22 21:02:15,495 INFO L858 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-11-22 21:02:15,495 INFO L858 garLoopResultBuilder]: For program point L4912-1(line 4912) no Hoare annotation was computed. [2021-11-22 21:02:15,495 INFO L858 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-11-22 21:02:15,495 INFO L858 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2021-11-22 21:02:15,495 INFO L858 garLoopResultBuilder]: For program point L4912(line 4912) no Hoare annotation was computed. [2021-11-22 21:02:15,496 INFO L858 garLoopResultBuilder]: For program point L4912-3(line 4912) no Hoare annotation was computed. [2021-11-22 21:02:15,496 INFO L854 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,496 INFO L854 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,496 INFO L854 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,496 INFO L858 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-11-22 21:02:15,496 INFO L854 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1 (= |ULTIMATE.start_ir_xbof_change_~xbof___0#1| 0)) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,496 INFO L858 garLoopResultBuilder]: For program point L5047(lines 5047 5052) no Hoare annotation was computed. [2021-11-22 21:02:15,496 INFO L854 garLoopResultBuilder]: At program point L4122-1(lines 4096 4123) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,497 INFO L858 garLoopResultBuilder]: For program point L5047-2(lines 5046 5060) no Hoare annotation was computed. [2021-11-22 21:02:15,497 INFO L858 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-11-22 21:02:15,497 INFO L854 garLoopResultBuilder]: At program point L3726(lines 3723 3728) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= 0 |ULTIMATE.start_ldv_undefined_pointer_#res#1.offset|) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_ldv_undefined_pointer_#res#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-11-22 21:02:15,497 INFO L854 garLoopResultBuilder]: At program point L3726-1(lines 3723 3728) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,497 INFO L858 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-11-22 21:02:15,497 INFO L858 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-11-22 21:02:15,497 INFO L854 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,497 INFO L854 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,497 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 21:02:15,498 INFO L854 garLoopResultBuilder]: At program point L4125-1(lines 4065 4127) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,498 INFO L854 garLoopResultBuilder]: At program point L4125(lines 4065 4127) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1 (= |ULTIMATE.start_ir_xbof_change_~xbof___0#1| 0)) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,498 INFO L854 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,498 INFO L858 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-11-22 21:02:15,498 INFO L858 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-11-22 21:02:15,498 INFO L858 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-11-22 21:02:15,498 INFO L858 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-11-22 21:02:15,498 INFO L858 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-11-22 21:02:15,498 INFO L854 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,498 INFO L858 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-11-22 21:02:15,498 INFO L858 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-11-22 21:02:15,499 INFO L854 garLoopResultBuilder]: At program point L5119(lines 5118 5120) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,499 INFO L854 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,499 INFO L861 garLoopResultBuilder]: At program point L5053-1(lines 5044 5061) the Hoare annotation is: true [2021-11-22 21:02:15,499 INFO L861 garLoopResultBuilder]: At program point L4921(lines 4921 4922) the Hoare annotation is: true [2021-11-22 21:02:15,499 INFO L861 garLoopResultBuilder]: At program point L4921-1(lines 4921 4922) the Hoare annotation is: true [2021-11-22 21:02:15,499 INFO L854 garLoopResultBuilder]: At program point L3732(lines 3729 3734) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,499 INFO L854 garLoopResultBuilder]: At program point L3732-1(lines 3729 3734) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (= ~ir_add_bof~0 0) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)))) [2021-11-22 21:02:15,499 INFO L854 garLoopResultBuilder]: At program point L4657(lines 4650 4659) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-22 21:02:15,500 INFO L854 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,500 INFO L858 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-11-22 21:02:15,500 INFO L858 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-11-22 21:02:15,500 INFO L854 garLoopResultBuilder]: At program point L5122(lines 5121 5123) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0)) [2021-11-22 21:02:15,504 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:02:15,505 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 21:02:15,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:02:15 BoogieIcfgContainer [2021-11-22 21:02:15,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 21:02:15,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 21:02:15,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 21:02:15,546 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 21:02:15,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:00:50" (3/4) ... [2021-11-22 21:02:15,548 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 21:02:15,568 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 176 nodes and edges [2021-11-22 21:02:15,571 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2021-11-22 21:02:15,573 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-22 21:02:15,574 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-11-22 21:02:15,576 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-22 21:02:15,577 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 21:02:15,578 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 21:02:15,579 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 21:02:15,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,604 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,606 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) && xbof___0 == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) && xbof___0 == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,608 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) && xbof___0 == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,609 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && 0 == \result) || ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && !(\result == 0)) && 0 == \result)) || ((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && \result == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && urb == 0) && 0 == \result) [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && urb == 0) && urb == 0) && 0 == \result) || ((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && urb == 0) && urb == 0) && 0 == \result) [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_coherent_state == 0 && 0 == \result) && ldv_urb_state == 0) && \result == 0) && !(\result == 0)) && !(\result == 0)) || (((((ldv_coherent_state == 0 && 0 == \result) && ldv_urb_state == 0) && \result == 0) && \result == 0) && \result == 0) [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && urb == 0) && 0 == \result [2021-11-22 21:02:15,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && !(urb == 0)) && !(arbitrary_memory == 0)) && !(\result == 0)) && !(\result == 0)) && urb == 0) && urb == 0) && 0 == \result [2021-11-22 21:02:15,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result [2021-11-22 21:02:15,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-22 21:02:15,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result [2021-11-22 21:02:15,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result [2021-11-22 21:02:15,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result [2021-11-22 21:02:15,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && urb == 0) && 0 == \result [2021-11-22 21:02:15,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && !(urb == 0)) && !(arbitrary_memory == 0)) && !(\result == 0)) && !(\result == 0)) && urb == 0) && urb == 0) && 0 == \result [2021-11-22 21:02:15,799 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 21:02:15,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 21:02:15,800 INFO L158 Benchmark]: Toolchain (without parser) took 88019.66ms. Allocated memory was 102.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 69.5MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 783.8MB. Max. memory is 16.1GB. [2021-11-22 21:02:15,800 INFO L158 Benchmark]: CDTParser took 15.42ms. Allocated memory is still 102.8MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:02:15,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1085.87ms. Allocated memory was 102.8MB in the beginning and 153.1MB in the end (delta: 50.3MB). Free memory was 69.2MB in the beginning and 95.5MB in the end (delta: -26.2MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2021-11-22 21:02:15,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.75ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 85.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-22 21:02:15,801 INFO L158 Benchmark]: Boogie Preprocessor took 97.34ms. Allocated memory is still 153.1MB. Free memory was 85.7MB in the beginning and 77.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 21:02:15,801 INFO L158 Benchmark]: RCFGBuilder took 1239.08ms. Allocated memory was 153.1MB in the beginning and 257.9MB in the end (delta: 104.9MB). Free memory was 77.4MB in the beginning and 183.3MB in the end (delta: -106.0MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2021-11-22 21:02:15,802 INFO L158 Benchmark]: TraceAbstraction took 85211.45ms. Allocated memory was 257.9MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 182.3MB in the beginning and 544.9MB in the end (delta: -362.6MB). Peak memory consumption was 745.8MB. Max. memory is 16.1GB. [2021-11-22 21:02:15,802 INFO L158 Benchmark]: Witness Printer took 254.08ms. Allocated memory is still 1.3GB. Free memory was 544.9MB in the beginning and 1.1GB in the end (delta: -597.8MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2021-11-22 21:02:15,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 15.42ms. Allocated memory is still 102.8MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1085.87ms. Allocated memory was 102.8MB in the beginning and 153.1MB in the end (delta: 50.3MB). Free memory was 69.2MB in the beginning and 95.5MB in the end (delta: -26.2MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.75ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 85.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.34ms. Allocated memory is still 153.1MB. Free memory was 85.7MB in the beginning and 77.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1239.08ms. Allocated memory was 153.1MB in the beginning and 257.9MB in the end (delta: 104.9MB). Free memory was 77.4MB in the beginning and 183.3MB in the end (delta: -106.0MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 85211.45ms. Allocated memory was 257.9MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 182.3MB in the beginning and 544.9MB in the end (delta: -362.6MB). Peak memory consumption was 745.8MB. Max. memory is 16.1GB. * Witness Printer took 254.08ms. Allocated memory is still 1.3GB. Free memory was 544.9MB in the beginning and 1.1GB in the end (delta: -597.8MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4912]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 295 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 85.1s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 78.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12176 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12176 mSDsluCounter, 27299 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18444 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 874 IncrementalHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 8855 mSDtfsCounter, 874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2777occurred in iteration=10, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 14697 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 137 PreInvPairs, 975 NumberOfFragments, 2774 HoareAnnotationTreeSize, 137 FomulaSimplifications, 3281921 FormulaSimplificationTreeSizeReduction, 57.2s HoareSimplificationTime, 137 FomulaSimplificationsInter, 3723827 FormulaSimplificationTreeSizeReductionInter, 20.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 698 NumberOfCodeBlocks, 698 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 1531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4458]: Loop Invariant Derived loop invariant: (((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && urb == 0) && urb == 0) && 0 == \result) || ((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && urb == 0) && urb == 0) && 0 == \result) - InvariantResult [Line: 4921]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4837]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5111]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5142]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5013]: Loop Invariant Derived loop invariant: (((((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && !(urb == 0)) && !(arbitrary_memory == 0)) && !(\result == 0)) && !(\result == 0)) && urb == 0) && urb == 0) && 0 == \result - InvariantResult [Line: 3619]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4468]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 3723]: Loop Invariant Derived loop invariant: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4333]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4332]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5150]: Loop Invariant Derived loop invariant: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4294]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4469]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5131]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5124]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) && xbof___0 == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4278]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4273]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4514]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4811]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && (retval + 1 <= 0 || 0 < retval)) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4489]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4921]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5128]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4151]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4379]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5115]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3974]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4495]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5097]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && 0 == \result) && ldv_urb_state == 0) && \result == 0) && !(\result == 0)) && !(\result == 0)) || (((((ldv_coherent_state == 0 && 0 == \result) && ldv_urb_state == 0) && \result == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3644]: Loop Invariant Derived loop invariant: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 5104]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4849]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5121]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5118]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4293]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5067]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4823]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3818]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5084]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5081]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3678]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4013]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4512]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4799]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4234]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3629]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3644]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3729]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4501]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4214]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4510]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5091]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4840]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: (((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && urb == 0) && 0 == \result - InvariantResult [Line: 5107]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4614]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 3625]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5013]: Loop Invariant Derived loop invariant: (((((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && !(urb == 0)) && !(arbitrary_memory == 0)) && !(\result == 0)) && !(\result == 0)) && urb == 0) && urb == 0) && 0 == \result - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4277]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4843]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5044]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) && xbof___0 == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5146]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3723]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4987]: Loop Invariant Derived loop invariant: ((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && 0 == \result) || ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && !(\result == 0)) && 0 == \result)) || ((((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && \result == 0) && 0 == \result) && ldv_urb_state == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && urb == 0) && 0 == \result) - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5135]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 3655]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4616]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && (retval + 1 <= 0 || 0 < retval)) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: (((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && urb == 0) && 0 == \result - InvariantResult [Line: 4037]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3689]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4312]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4650]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4507]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3729]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4822]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4992]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4504]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 3699]: Loop Invariant Derived loop invariant: ((((((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && 0 == \result) && \result == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 3822]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5094]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4616]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && (retval + 1 <= 0 || 0 < retval)) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4846]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) && xbof___0 == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) RESULT: Ultimate proved your program to be correct! [2021-11-22 21:02:15,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE