./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 5b36d44f 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-wip.dd.seqcomp-5b36d44 [2021-11-07 10:33:38,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 10:33:38,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 10:33:38,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 10:33:38,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 10:33:38,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 10:33:38,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 10:33:38,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 10:33:38,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 10:33:38,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 10:33:38,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 10:33:38,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 10:33:38,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 10:33:38,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 10:33:38,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 10:33:38,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 10:33:38,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 10:33:38,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 10:33:38,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 10:33:38,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 10:33:38,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 10:33:38,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 10:33:38,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 10:33:38,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 10:33:38,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 10:33:38,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 10:33:38,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 10:33:38,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 10:33:38,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 10:33:38,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 10:33:38,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 10:33:38,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 10:33:38,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 10:33:38,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 10:33:38,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 10:33:38,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 10:33:38,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 10:33:38,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 10:33:38,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 10:33:38,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 10:33:38,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 10:33:38,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-07 10:33:38,395 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 10:33:38,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 10:33:38,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 10:33:38,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 10:33:38,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 10:33:38,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 10:33:38,397 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 10:33:38,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 10:33:38,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 10:33:38,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 10:33:38,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 10:33:38,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 10:33:38,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 10:33:38,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 10:33:38,399 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 10:33:38,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 10:33:38,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 10:33:38,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 10:33:38,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 10:33:38,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 10:33:38,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 10:33:38,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 10:33:38,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 10:33:38,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 10:33:38,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 10:33:38,400 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 10:33:38,401 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 10:33:38,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 10:33:38,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 10:33:38,402 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-07 10:33:38,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 10:33:38,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 10:33:38,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 10:33:38,614 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 10:33:38,615 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 10:33:38,616 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-07 10:33:38,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb8a1863/eda4feaa76fa4861b93e72c866827210/FLAGec6125dd8 [2021-11-07 10:33:39,256 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 10:33:39,257 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-07 10:33:39,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb8a1863/eda4feaa76fa4861b93e72c866827210/FLAGec6125dd8 [2021-11-07 10:33:39,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb8a1863/eda4feaa76fa4861b93e72c866827210 [2021-11-07 10:33:39,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 10:33:39,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 10:33:39,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 10:33:39,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 10:33:39,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 10:33:39,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:33:39" (1/1) ... [2021-11-07 10:33:39,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349e5043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:39, skipping insertion in model container [2021-11-07 10:33:39,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:33:39" (1/1) ... [2021-11-07 10:33:39,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 10:33:39,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 10:33:40,154 WARN L228 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-07 10:33:40,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 10:33:40,207 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 10:33:40,395 WARN L228 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-07 10:33:40,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 10:33:40,439 INFO L208 MainTranslator]: Completed translation [2021-11-07 10:33:40,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40 WrapperNode [2021-11-07 10:33:40,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 10:33:40,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 10:33:40,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 10:33:40,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 10:33:40,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 10:33:40,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 10:33:40,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 10:33:40,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 10:33:40,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 10:33:40,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 10:33:40,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 10:33:40,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 10:33:40,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (1/1) ... [2021-11-07 10:33:40,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 10:33:40,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 10:33:40,724 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-07 10:33:40,727 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-07 10:33:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 10:33:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 10:33:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 10:33:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 10:33:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 10:33:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 10:33:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 10:33:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 10:33:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 10:33:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 10:33:40,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 10:33:41,133 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 10:33:41,137 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 10:33:41,142 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 10:33:41,143 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 10:33:41,157 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 10:33:44,529 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2021-11-07 10:33:44,530 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2021-11-07 10:33:44,530 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2021-11-07 10:33:44,530 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2021-11-07 10:33:44,530 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##339: assume false; [2021-11-07 10:33:44,530 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##340: assume !false; [2021-11-07 10:33:44,530 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2021-11-07 10:33:44,530 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2021-11-07 10:33:44,530 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2021-11-07 10:33:44,531 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2021-11-07 10:33:44,536 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 10:33:44,536 INFO L299 CfgBuilder]: Removed 156 assume(true) statements. [2021-11-07 10:33:44,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:44 BoogieIcfgContainer [2021-11-07 10:33:44,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 10:33:44,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 10:33:44,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 10:33:44,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 10:33:44,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:33:39" (1/3) ... [2021-11-07 10:33:44,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7236c70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:33:44, skipping insertion in model container [2021-11-07 10:33:44,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:40" (2/3) ... [2021-11-07 10:33:44,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7236c70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:33:44, skipping insertion in model container [2021-11-07 10:33:44,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:44" (3/3) ... [2021-11-07 10:33:44,543 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-11-07 10:33:44,546 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 10:33:44,546 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-07 10:33:44,576 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 10:33:44,581 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-07 10:33:44,581 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-07 10:33:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 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-07 10:33:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 10:33:44,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:44,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 10:33:44,596 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-07 10:33:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 986721885, now seen corresponding path program 1 times [2021-11-07 10:33:44,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:44,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754305013] [2021-11-07 10:33:44,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:44,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:44,934 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-07 10:33:44,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:44,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754305013] [2021-11-07 10:33:44,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754305013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:44,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:44,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 10:33:44,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906548608] [2021-11-07 10:33:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:44,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 10:33:44,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 10:33:44,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:44,957 INFO L87 Difference]: Start difference. First operand has 279 states, 274 states have (on average 1.5583941605839415) internal successors, (427), 278 states have internal predecessors, (427), 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.0) internal successors, (12), 3 states have internal predecessors, (12), 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-07 10:33:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:45,160 INFO L93 Difference]: Finished difference Result 788 states and 1214 transitions. [2021-11-07 10:33:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 10:33:45,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-11-07 10:33:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:45,171 INFO L225 Difference]: With dead ends: 788 [2021-11-07 10:33:45,171 INFO L226 Difference]: Without dead ends: 502 [2021-11-07 10:33:45,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.77ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 10:33:45,176 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 334 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.93ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 147.98ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:45,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 967 Invalid, 135 Unknown, 0 Unchecked, 5.93ms Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 147.98ms Time] [2021-11-07 10:33:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-11-07 10:33:45,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 272. [2021-11-07 10:33:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.3619402985074627) internal successors, (365), 271 states have internal predecessors, (365), 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-07 10:33:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 365 transitions. [2021-11-07 10:33:45,210 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 365 transitions. Word has length 12 [2021-11-07 10:33:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:45,211 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 365 transitions. [2021-11-07 10:33:45,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-07 10:33:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2021-11-07 10:33:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 10:33:45,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:45,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 10:33:45,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 10:33:45,212 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-07 10:33:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1666780255, now seen corresponding path program 1 times [2021-11-07 10:33:45,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:45,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608004990] [2021-11-07 10:33:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:45,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:45,311 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-07 10:33:45,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:45,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608004990] [2021-11-07 10:33:45,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608004990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:45,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:45,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 10:33:45,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016712681] [2021-11-07 10:33:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:45,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 10:33:45,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 10:33:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 10:33:45,315 INFO L87 Difference]: Start difference. First operand 272 states and 365 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-07 10:33:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:45,338 INFO L93 Difference]: Finished difference Result 781 states and 1056 transitions. [2021-11-07 10:33:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 10:33:45,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-11-07 10:33:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:45,341 INFO L225 Difference]: With dead ends: 781 [2021-11-07 10:33:45,341 INFO L226 Difference]: Without dead ends: 523 [2021-11-07 10:33:45,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.70ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 10:33:45,343 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 348 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.55ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.74ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:45,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 698 Invalid, 15 Unknown, 0 Unchecked, 1.55ms Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 11.74ms Time] [2021-11-07 10:33:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-11-07 10:33:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2021-11-07 10:33:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 515 states have (on average 1.3650485436893205) internal successors, (703), 518 states have internal predecessors, (703), 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-07 10:33:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 703 transitions. [2021-11-07 10:33:45,359 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 703 transitions. Word has length 12 [2021-11-07 10:33:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:45,360 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 703 transitions. [2021-11-07 10:33:45,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-07 10:33:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 703 transitions. [2021-11-07 10:33:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 10:33:45,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:45,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 10:33:45,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 10:33:45,361 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-07 10:33:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash 130579806, now seen corresponding path program 1 times [2021-11-07 10:33:45,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:45,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401811043] [2021-11-07 10:33:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:45,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:45,445 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-07 10:33:45,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:45,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401811043] [2021-11-07 10:33:45,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401811043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:45,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:45,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 10:33:45,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938896128] [2021-11-07 10:33:45,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:45,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 10:33:45,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:45,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 10:33:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 10:33:45,448 INFO L87 Difference]: Start difference. First operand 519 states and 703 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-07 10:33:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:45,478 INFO L93 Difference]: Finished difference Result 519 states and 703 transitions. [2021-11-07 10:33:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 10:33:45,478 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-07 10:33:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:45,480 INFO L225 Difference]: With dead ends: 519 [2021-11-07 10:33:45,480 INFO L226 Difference]: Without dead ends: 513 [2021-11-07 10:33:45,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.79ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 10:33:45,481 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.76ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:45,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.76ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 10:33:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-11-07 10:33:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-11-07 10:33:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 512 states have internal predecessors, (694), 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-07 10:33:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 694 transitions. [2021-11-07 10:33:45,491 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 694 transitions. Word has length 13 [2021-11-07 10:33:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:45,492 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 694 transitions. [2021-11-07 10:33:45,492 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-07 10:33:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 694 transitions. [2021-11-07 10:33:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 10:33:45,494 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:45,494 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] [2021-11-07 10:33:45,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 10:33:45,495 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 10:33:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1133933506, now seen corresponding path program 1 times [2021-11-07 10:33:45,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:45,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668128448] [2021-11-07 10:33:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:45,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:45,594 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-07 10:33:45,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:45,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668128448] [2021-11-07 10:33:45,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668128448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:45,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:45,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 10:33:45,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333551661] [2021-11-07 10:33:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:45,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 10:33:45,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:45,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 10:33:45,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:45,596 INFO L87 Difference]: Start difference. First operand 513 states and 694 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-07 10:33:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:45,743 INFO L93 Difference]: Finished difference Result 1458 states and 1991 transitions. [2021-11-07 10:33:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 10:33:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2021-11-07 10:33:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:45,747 INFO L225 Difference]: With dead ends: 1458 [2021-11-07 10:33:45,747 INFO L226 Difference]: Without dead ends: 959 [2021-11-07 10:33:45,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.43ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 10:33:45,749 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 307 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.92ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.86ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:45,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 930 Invalid, 138 Unknown, 0 Unchecked, 1.92ms Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 117.86ms Time] [2021-11-07 10:33:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-11-07 10:33:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 947. [2021-11-07 10:33:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 944 states have (on average 1.3781779661016949) internal successors, (1301), 946 states have internal predecessors, (1301), 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-07 10:33:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1301 transitions. [2021-11-07 10:33:45,768 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1301 transitions. Word has length 49 [2021-11-07 10:33:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:45,768 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1301 transitions. [2021-11-07 10:33:45,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-07 10:33:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1301 transitions. [2021-11-07 10:33:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 10:33:45,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:45,771 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] [2021-11-07 10:33:45,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 10:33:45,771 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 10:33:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1156565760, now seen corresponding path program 1 times [2021-11-07 10:33:45,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:45,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597795716] [2021-11-07 10:33:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:45,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:45,887 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-07 10:33:45,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:45,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597795716] [2021-11-07 10:33:45,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597795716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:45,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:45,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 10:33:45,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145188158] [2021-11-07 10:33:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:45,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 10:33:45,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 10:33:45,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 10:33:45,889 INFO L87 Difference]: Start difference. First operand 947 states and 1301 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-07 10:33:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:46,109 INFO L93 Difference]: Finished difference Result 5883 states and 8075 transitions. [2021-11-07 10:33:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 10:33:46,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2021-11-07 10:33:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:46,126 INFO L225 Difference]: With dead ends: 5883 [2021-11-07 10:33:46,127 INFO L226 Difference]: Without dead ends: 5410 [2021-11-07 10:33:46,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 39.21ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 10:33:46,129 INFO L933 BasicCegarLoop]: 826 mSDtfsCounter, 2058 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.77ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.64ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:46,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2058 Valid, 3130 Invalid, 55 Unknown, 0 Unchecked, 5.77ms Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 43.64ms Time] [2021-11-07 10:33:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-11-07 10:33:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 959. [2021-11-07 10:33:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 956 states have (on average 1.3734309623430963) internal successors, (1313), 958 states have internal predecessors, (1313), 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-07 10:33:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1313 transitions. [2021-11-07 10:33:46,219 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1313 transitions. Word has length 49 [2021-11-07 10:33:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:46,219 INFO L470 AbstractCegarLoop]: Abstraction has 959 states and 1313 transitions. [2021-11-07 10:33:46,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-07 10:33:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1313 transitions. [2021-11-07 10:33:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 10:33:46,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:46,221 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] [2021-11-07 10:33:46,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 10:33:46,222 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 10:33:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 145448510, now seen corresponding path program 1 times [2021-11-07 10:33:46,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:46,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614250708] [2021-11-07 10:33:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:46,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:46,338 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-07 10:33:46,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:46,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614250708] [2021-11-07 10:33:46,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614250708] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:46,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:46,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 10:33:46,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502037119] [2021-11-07 10:33:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:46,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 10:33:46,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 10:33:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 10:33:46,341 INFO L87 Difference]: Start difference. First operand 959 states and 1313 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-07 10:33:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:46,759 INFO L93 Difference]: Finished difference Result 3721 states and 5095 transitions. [2021-11-07 10:33:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 10:33:46,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 49 [2021-11-07 10:33:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:46,767 INFO L225 Difference]: With dead ends: 3721 [2021-11-07 10:33:46,767 INFO L226 Difference]: Without dead ends: 2776 [2021-11-07 10:33:46,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 54.83ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-07 10:33:46,769 INFO L933 BasicCegarLoop]: 1322 mSDtfsCounter, 1585 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 235.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 4903 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.92ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 255.73ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:46,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1585 Valid, 4903 Invalid, 110 Unknown, 0 Unchecked, 6.92ms Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 255.73ms Time] [2021-11-07 10:33:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2021-11-07 10:33:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 957. [2021-11-07 10:33:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 954 states have (on average 1.370020964360587) internal successors, (1307), 956 states have internal predecessors, (1307), 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-07 10:33:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1307 transitions. [2021-11-07 10:33:46,849 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1307 transitions. Word has length 49 [2021-11-07 10:33:46,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:46,849 INFO L470 AbstractCegarLoop]: Abstraction has 957 states and 1307 transitions. [2021-11-07 10:33:46,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-07 10:33:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1307 transitions. [2021-11-07 10:33:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 10:33:46,850 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:46,850 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-07 10:33:46,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 10:33:46,851 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-07 10:33:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1338025611, now seen corresponding path program 1 times [2021-11-07 10:33:46,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:46,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455173778] [2021-11-07 10:33:46,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:46,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:46,938 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-07 10:33:46,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:46,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455173778] [2021-11-07 10:33:46,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455173778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:46,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:46,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 10:33:46,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279758517] [2021-11-07 10:33:46,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:46,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 10:33:46,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:46,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 10:33:46,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:46,940 INFO L87 Difference]: Start difference. First operand 957 states and 1307 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-07 10:33:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:47,035 INFO L93 Difference]: Finished difference Result 2709 states and 3722 transitions. [2021-11-07 10:33:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 10:33:47,036 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-07 10:33:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:47,040 INFO L225 Difference]: With dead ends: 2709 [2021-11-07 10:33:47,040 INFO L226 Difference]: Without dead ends: 1766 [2021-11-07 10:33:47,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.95ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 10:33:47,042 INFO L933 BasicCegarLoop]: 663 mSDtfsCounter, 513 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.81ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.05ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:47,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 1468 Invalid, 14 Unknown, 0 Unchecked, 1.81ms Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 22.05ms Time] [2021-11-07 10:33:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2021-11-07 10:33:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 929. [2021-11-07 10:33:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 926 states have (on average 1.3682505399568035) internal successors, (1267), 928 states have internal predecessors, (1267), 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-07 10:33:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1267 transitions. [2021-11-07 10:33:47,106 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1267 transitions. Word has length 52 [2021-11-07 10:33:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:47,107 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1267 transitions. [2021-11-07 10:33:47,107 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-07 10:33:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1267 transitions. [2021-11-07 10:33:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 10:33:47,108 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:47,108 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-07 10:33:47,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 10:33:47,108 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-07 10:33:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1261439541, now seen corresponding path program 1 times [2021-11-07 10:33:47,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:47,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248313634] [2021-11-07 10:33:47,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:47,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:47,193 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-07 10:33:47,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:47,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248313634] [2021-11-07 10:33:47,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248313634] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:47,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:47,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 10:33:47,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923463300] [2021-11-07 10:33:47,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:47,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 10:33:47,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:47,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 10:33:47,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:47,195 INFO L87 Difference]: Start difference. First operand 929 states and 1267 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-07 10:33:49,222 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 10:33:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:49,394 INFO L93 Difference]: Finished difference Result 1415 states and 1927 transitions. [2021-11-07 10:33:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 10:33:49,394 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-07 10:33:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:49,398 INFO L225 Difference]: With dead ends: 1415 [2021-11-07 10:33:49,398 INFO L226 Difference]: Without dead ends: 1411 [2021-11-07 10:33:49,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.75ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:49,399 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 612 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2034.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2127.58ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:49,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 1351 Invalid, 27 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2127.58ms Time] [2021-11-07 10:33:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2021-11-07 10:33:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1400. [2021-11-07 10:33:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1397 states have (on average 1.3686471009305654) internal successors, (1912), 1399 states have internal predecessors, (1912), 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-07 10:33:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1912 transitions. [2021-11-07 10:33:49,520 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1912 transitions. Word has length 52 [2021-11-07 10:33:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:49,520 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1912 transitions. [2021-11-07 10:33:49,520 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-07 10:33:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1912 transitions. [2021-11-07 10:33:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 10:33:49,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:49,521 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] [2021-11-07 10:33:49,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 10:33:49,521 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-07 10:33:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1042941183, now seen corresponding path program 1 times [2021-11-07 10:33:49,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:49,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613571379] [2021-11-07 10:33:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:49,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:49,656 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-07 10:33:49,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:49,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613571379] [2021-11-07 10:33:49,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613571379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:49,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:49,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 10:33:49,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742148707] [2021-11-07 10:33:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:49,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 10:33:49,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 10:33:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:49,658 INFO L87 Difference]: Start difference. First operand 1400 states and 1912 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-07 10:33:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:50,028 INFO L93 Difference]: Finished difference Result 6295 states and 8608 transitions. [2021-11-07 10:33:50,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 10:33:50,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2021-11-07 10:33:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:50,042 INFO L225 Difference]: With dead ends: 6295 [2021-11-07 10:33:50,042 INFO L226 Difference]: Without dead ends: 4909 [2021-11-07 10:33:50,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.14ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 10:33:50,045 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 852 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.21ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.92ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:50,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [852 Valid, 1540 Invalid, 77 Unknown, 0 Unchecked, 3.21ms Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 67.92ms Time] [2021-11-07 10:33:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2021-11-07 10:33:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 2687. [2021-11-07 10:33:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2684 states have (on average 1.3628912071535022) internal successors, (3658), 2686 states have internal predecessors, (3658), 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-07 10:33:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3658 transitions. [2021-11-07 10:33:50,208 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3658 transitions. Word has length 58 [2021-11-07 10:33:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:50,208 INFO L470 AbstractCegarLoop]: Abstraction has 2687 states and 3658 transitions. [2021-11-07 10:33:50,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-07 10:33:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3658 transitions. [2021-11-07 10:33:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 10:33:50,210 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:50,210 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] [2021-11-07 10:33:50,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 10:33:50,210 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-07 10:33:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1699019577, now seen corresponding path program 1 times [2021-11-07 10:33:50,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:50,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382557206] [2021-11-07 10:33:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:50,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:50,286 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-07 10:33:50,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:50,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382557206] [2021-11-07 10:33:50,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382557206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:50,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:50,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 10:33:50,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957644604] [2021-11-07 10:33:50,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:50,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 10:33:50,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:50,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 10:33:50,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:50,288 INFO L87 Difference]: Start difference. First operand 2687 states and 3658 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-07 10:33:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:50,651 INFO L93 Difference]: Finished difference Result 5265 states and 7149 transitions. [2021-11-07 10:33:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 10:33:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2021-11-07 10:33:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:50,659 INFO L225 Difference]: With dead ends: 5265 [2021-11-07 10:33:50,659 INFO L226 Difference]: Without dead ends: 2592 [2021-11-07 10:33:50,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.11ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 10:33:50,663 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 272 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 186.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.18ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 218.83ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:50,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 936 Invalid, 136 Unknown, 0 Unchecked, 2.18ms Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 218.83ms Time] [2021-11-07 10:33:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2021-11-07 10:33:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2573. [2021-11-07 10:33:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2573 states, 2570 states have (on average 1.3556420233463036) internal successors, (3484), 2572 states have internal predecessors, (3484), 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-07 10:33:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3484 transitions. [2021-11-07 10:33:50,823 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3484 transitions. Word has length 58 [2021-11-07 10:33:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:50,823 INFO L470 AbstractCegarLoop]: Abstraction has 2573 states and 3484 transitions. [2021-11-07 10:33:50,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-07 10:33:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3484 transitions. [2021-11-07 10:33:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-07 10:33:50,825 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:50,825 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] [2021-11-07 10:33:50,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 10:33:50,825 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-07 10:33:50,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash 589140347, now seen corresponding path program 1 times [2021-11-07 10:33:50,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:50,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629288835] [2021-11-07 10:33:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:50,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:51,004 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-07 10:33:51,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:51,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629288835] [2021-11-07 10:33:51,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629288835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:51,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:51,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 10:33:51,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633690238] [2021-11-07 10:33:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:51,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 10:33:51,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:51,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 10:33:51,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-07 10:33:51,008 INFO L87 Difference]: Start difference. First operand 2573 states and 3484 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-07 10:33:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:51,563 INFO L93 Difference]: Finished difference Result 4491 states and 6067 transitions. [2021-11-07 10:33:51,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 10:33:51,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 66 [2021-11-07 10:33:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:51,571 INFO L225 Difference]: With dead ends: 4491 [2021-11-07 10:33:51,571 INFO L226 Difference]: Without dead ends: 2728 [2021-11-07 10:33:51,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 161.77ms TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-11-07 10:33:51,575 INFO L933 BasicCegarLoop]: 1089 mSDtfsCounter, 2243 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 186.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.06ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 205.98ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:51,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2243 Valid, 4041 Invalid, 120 Unknown, 0 Unchecked, 6.06ms Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 205.98ms Time] [2021-11-07 10:33:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2021-11-07 10:33:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 1777. [2021-11-07 10:33:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1774 states have (on average 1.342728297632469) internal successors, (2382), 1776 states have internal predecessors, (2382), 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-07 10:33:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2382 transitions. [2021-11-07 10:33:51,667 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2382 transitions. Word has length 66 [2021-11-07 10:33:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:51,668 INFO L470 AbstractCegarLoop]: Abstraction has 1777 states and 2382 transitions. [2021-11-07 10:33:51,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-07 10:33:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2382 transitions. [2021-11-07 10:33:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-07 10:33:51,669 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:51,669 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] [2021-11-07 10:33:51,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 10:33:51,670 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-07 10:33:51,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1323881078, now seen corresponding path program 1 times [2021-11-07 10:33:51,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:51,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240649495] [2021-11-07 10:33:51,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:51,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:52,129 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-07 10:33:52,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:52,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240649495] [2021-11-07 10:33:52,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240649495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:52,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:52,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 10:33:52,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647585552] [2021-11-07 10:33:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:52,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 10:33:52,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 10:33:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 10:33:52,131 INFO L87 Difference]: Start difference. First operand 1777 states and 2382 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-07 10:33:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:52,247 INFO L93 Difference]: Finished difference Result 3542 states and 4750 transitions. [2021-11-07 10:33:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 10:33:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 68 [2021-11-07 10:33:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:52,253 INFO L225 Difference]: With dead ends: 3542 [2021-11-07 10:33:52,253 INFO L226 Difference]: Without dead ends: 1775 [2021-11-07 10:33:52,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.70ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 10:33:52,255 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 4 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.07ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.79ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:52,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1417 Invalid, 15 Unknown, 0 Unchecked, 1.07ms Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 9.79ms Time] [2021-11-07 10:33:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2021-11-07 10:33:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2021-11-07 10:33:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1772 states have (on average 1.3419864559819412) internal successors, (2378), 1774 states have internal predecessors, (2378), 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-07 10:33:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2378 transitions. [2021-11-07 10:33:52,377 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2378 transitions. Word has length 68 [2021-11-07 10:33:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:52,377 INFO L470 AbstractCegarLoop]: Abstraction has 1775 states and 2378 transitions. [2021-11-07 10:33:52,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-07 10:33:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2378 transitions. [2021-11-07 10:33:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 10:33:52,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 10:33:52,378 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] [2021-11-07 10:33:52,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 10:33:52,379 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-07 10:33:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 10:33:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1468975635, now seen corresponding path program 1 times [2021-11-07 10:33:52,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 10:33:52,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986385032] [2021-11-07 10:33:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 10:33:52,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 10:33:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 10:33:52,716 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-07 10:33:52,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 10:33:52,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986385032] [2021-11-07 10:33:52,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986385032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 10:33:52,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 10:33:52,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 10:33:52,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575249395] [2021-11-07 10:33:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 10:33:52,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 10:33:52,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 10:33:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 10:33:52,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:52,718 INFO L87 Difference]: Start difference. First operand 1775 states and 2378 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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-07 10:33:54,741 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 10:33:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 10:33:54,935 INFO L93 Difference]: Finished difference Result 1775 states and 2378 transitions. [2021-11-07 10:33:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 10:33:54,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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 70 [2021-11-07 10:33:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 10:33:54,936 INFO L225 Difference]: With dead ends: 1775 [2021-11-07 10:33:54,936 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 10:33:54,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.03ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 10:33:54,938 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 283 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2028.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.01ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2141.35ms IncrementalHoareTripleChecker+Time [2021-11-07 10:33:54,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 689 Invalid, 14 Unknown, 0 Unchecked, 1.01ms Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 2141.35ms Time] [2021-11-07 10:33:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 10:33:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 10:33:54,939 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-07 10:33:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 10:33:54,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-11-07 10:33:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 10:33:54,940 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 10:33:54,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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-07 10:33:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 10:33:54,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 10:33:54,942 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-11-07 10:33:54,942 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2021-11-07 10:33:54,942 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2021-11-07 10:33:54,942 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2021-11-07 10:33:54,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 10:33:54,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 10:34:25,921 INFO L858 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-11-07 10:34:25,921 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-07 10:34:25,922 INFO L854 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,922 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.offset| 0)) [2021-11-07 10:34:25,922 INFO L858 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-11-07 10:34:25,922 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,922 INFO L858 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-11-07 10:34:25,922 INFO L858 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,922 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,923 INFO L858 garLoopResultBuilder]: For program point L4068-1(lines 4068 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,923 INFO L858 garLoopResultBuilder]: For program point L4993(line 4993) no Hoare annotation was computed. [2021-11-07 10:34:25,923 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,924 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,924 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.offset| 0)) [2021-11-07 10:34:25,924 INFO L858 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-11-07 10:34:25,924 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.offset| 0)) [2021-11-07 10:34:25,924 INFO L858 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-11-07 10:34:25,925 INFO L858 garLoopResultBuilder]: For program point L4071-1(lines 4071 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,925 INFO L858 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,925 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.offset| 0)) [2021-11-07 10:34:25,925 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.offset| 0)) [2021-11-07 10:34:25,925 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,925 INFO L858 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-11-07 10:34:25,927 INFO L858 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-11-07 10:34:25,927 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,927 INFO L858 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-11-07 10:34:25,928 INFO L858 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,928 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.offset| 0)) [2021-11-07 10:34:25,930 INFO L858 garLoopResultBuilder]: For program point L4074-1(lines 4074 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,931 INFO L858 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-11-07 10:34:25,931 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,936 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.offset| 0)) [2021-11-07 10:34:25,936 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-07 10:34:25,936 INFO L858 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-11-07 10:34:25,937 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-07 10:34:25,937 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.offset| 0)) [2021-11-07 10:34:25,937 INFO L858 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-11-07 10:34:25,937 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.offset| 0)) [2021-11-07 10:34:25,937 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-11-07 10:34:25,938 INFO L858 garLoopResultBuilder]: For program point L4077-1(lines 4077 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,938 INFO L858 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,938 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,938 INFO L858 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-11-07 10:34:25,939 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-07 10:34:25,939 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.offset| 0)) [2021-11-07 10:34:25,947 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,947 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.offset| 0)) [2021-11-07 10:34:25,947 INFO L858 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,947 INFO L858 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-11-07 10:34:25,947 INFO L858 garLoopResultBuilder]: For program point L4080-1(lines 4080 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,947 INFO L858 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-11-07 10:34:25,947 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,947 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.offset| 0)) [2021-11-07 10:34:25,948 INFO L858 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-11-07 10:34:25,948 INFO L858 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-11-07 10:34:25,948 INFO L858 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-11-07 10:34:25,948 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.offset| 0)) [2021-11-07 10:34:25,948 INFO L858 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-11-07 10:34:25,948 INFO L858 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-11-07 10:34:25,949 INFO L854 garLoopResultBuilder]: At program point L5139(lines 1 5156) the Hoare annotation is: (and (or (< 0 ULTIMATE.start_ir_init_~retval~0) (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0)) (= ~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-07 10:34:25,949 INFO L854 garLoopResultBuilder]: At program point L5139-1(lines 5047 5052) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-07 10:34:25,949 INFO L858 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-11-07 10:34:25,949 INFO L858 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-11-07 10:34:25,949 INFO L858 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-11-07 10:34:25,949 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.offset| 0)) [2021-11-07 10:34:25,949 INFO L858 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-11-07 10:34:25,950 INFO L858 garLoopResultBuilder]: For program point L4083-1(lines 4083 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,950 INFO L858 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,950 INFO L858 garLoopResultBuilder]: For program point L5074-4(line 5074) no Hoare annotation was computed. [2021-11-07 10:34:25,950 INFO L858 garLoopResultBuilder]: For program point L5074-2(line 5074) no Hoare annotation was computed. [2021-11-07 10:34:25,951 INFO L858 garLoopResultBuilder]: For program point L5074-6(line 5074) no Hoare annotation was computed. [2021-11-07 10:34:25,951 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,951 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,951 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.offset| 0)) [2021-11-07 10:34:25,951 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.offset| 0)) [2021-11-07 10:34:25,952 INFO L854 garLoopResultBuilder]: At program point L5075-1(lines 5072 5076) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,952 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,952 INFO L854 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (let ((.cse3 (= ~ldv_urb_state~0 0)) (.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse9 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0)) (.cse7 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse8 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse6 (= ULTIMATE.start_usb_free_urb_~urb.offset 0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse9 .cse7 .cse8) (and .cse0 .cse1 (<= 1 ~ldv_urb_state~0) .cse2 (not (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (not .cse6) (<= ~ldv_urb_state~0 1) (not .cse9) .cse7 (not (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) .cse8))) [2021-11-07 10:34:25,952 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.offset| 0)) [2021-11-07 10:34:25,952 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.offset| 0)) [2021-11-07 10:34:25,952 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,952 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,952 INFO L858 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-11-07 10:34:25,953 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.offset| 0)) [2021-11-07 10:34:25,953 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.offset| 0)) [2021-11-07 10:34:25,953 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.offset| 0)) [2021-11-07 10:34:25,953 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,953 INFO L858 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-11-07 10:34:25,954 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,954 INFO L858 garLoopResultBuilder]: For program point L4086-1(lines 4086 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,954 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.offset| 0)) [2021-11-07 10:34:25,954 INFO L858 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-11-07 10:34:25,954 INFO L858 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-11-07 10:34:25,954 INFO L854 garLoopResultBuilder]: At program point L5078(lines 5077 5079) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,954 INFO L858 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-11-07 10:34:25,954 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,955 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.offset| 0)) [2021-11-07 10:34:25,955 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.offset| 0)) [2021-11-07 10:34:25,955 INFO L858 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-11-07 10:34:25,955 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 10:34:25,955 INFO L858 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-11-07 10:34:25,955 INFO L858 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-11-07 10:34:25,955 INFO L858 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-11-07 10:34:25,955 INFO L858 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-11-07 10:34:25,955 INFO L858 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-11-07 10:34:25,955 INFO L858 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-11-07 10:34:25,956 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.offset| 0)) [2021-11-07 10:34:25,956 INFO L858 garLoopResultBuilder]: For program point L4089-1(lines 4089 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,956 INFO L858 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,956 INFO L858 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,956 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-07 10:34:25,957 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.offset| 0)) [2021-11-07 10:34:25,957 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,957 INFO L858 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-11-07 10:34:25,957 INFO L858 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-11-07 10:34:25,957 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,957 INFO L858 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-11-07 10:34:25,957 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,957 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,957 INFO L858 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-11-07 10:34:25,958 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.offset| 0)) [2021-11-07 10:34:25,958 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-07 10:34:25,958 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,958 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.offset| 0)) [2021-11-07 10:34:25,958 INFO L858 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,958 INFO L858 garLoopResultBuilder]: For program point L4092-1(lines 4092 4124) no Hoare annotation was computed. [2021-11-07 10:34:25,958 INFO L854 garLoopResultBuilder]: At program point L5017-2loopEntry(lines 5017 5036) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= ULTIMATE.start_usb_free_urb_~urb.offset 0) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,959 INFO L854 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= ULTIMATE.start_usb_free_urb_~urb.offset 0) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,959 INFO L858 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-11-07 10:34:25,959 INFO L858 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,959 INFO L858 garLoopResultBuilder]: For program point L4357-2(lines 4357 4367) no Hoare annotation was computed. [2021-11-07 10:34:25,959 INFO L858 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-11-07 10:34:25,959 INFO L858 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-11-07 10:34:25,960 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,960 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) .cse1))) [2021-11-07 10:34:25,960 INFO L858 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-11-07 10:34:25,960 INFO L858 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-11-07 10:34:25,960 INFO L858 garLoopResultBuilder]: For program point L5018-1(lines 5017 5036) no Hoare annotation was computed. [2021-11-07 10:34:25,961 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,962 INFO L858 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-11-07 10:34:25,963 INFO L854 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,963 INFO L858 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-11-07 10:34:25,963 INFO L858 garLoopResultBuilder]: For program point L5019-1(lines 5017 5036) no Hoare annotation was computed. [2021-11-07 10:34:25,963 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.offset| 0)) [2021-11-07 10:34:25,963 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-07 10:34:25,963 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,963 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.offset| 0)) [2021-11-07 10:34:25,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-07 10:34:25,964 INFO L858 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,964 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,964 INFO L858 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-11-07 10:34:25,964 INFO L858 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-11-07 10:34:25,964 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,964 INFO L858 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-11-07 10:34:25,964 INFO L854 garLoopResultBuilder]: At program point L5154(lines 1 5156) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,965 INFO L858 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-11-07 10:34:25,965 INFO L858 garLoopResultBuilder]: For program point L5154-1(lines 5154 5156) no Hoare annotation was computed. [2021-11-07 10:34:25,965 INFO L858 garLoopResultBuilder]: For program point L5154-2(lines 5154 5156) no Hoare annotation was computed. [2021-11-07 10:34:25,965 INFO L858 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-11-07 10:34:25,965 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.offset| 0)) [2021-11-07 10:34:25,965 INFO L858 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-11-07 10:34:25,965 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.offset| 0)) [2021-11-07 10:34:25,965 INFO L858 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-11-07 10:34:25,965 INFO L858 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-11-07 10:34:25,966 INFO L858 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-11-07 10:34:25,966 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,966 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,966 INFO L858 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,966 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,966 INFO L858 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-11-07 10:34:25,966 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.offset| 0)) [2021-11-07 10:34:25,967 INFO L858 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-11-07 10:34:25,967 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.offset| 0)) [2021-11-07 10:34:25,967 INFO L858 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-11-07 10:34:25,983 INFO L854 garLoopResultBuilder]: At program point L5092(lines 4860 4863) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,983 INFO L858 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-11-07 10:34:25,984 INFO L858 garLoopResultBuilder]: For program point L5026-2(lines 5026 5031) no Hoare annotation was computed. [2021-11-07 10:34:25,984 INFO L858 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-11-07 10:34:25,984 INFO L858 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,984 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-07 10:34:25,984 INFO L858 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-11-07 10:34:25,984 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,984 INFO L858 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-11-07 10:34:25,984 INFO L858 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-11-07 10:34:25,984 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.offset| 0)) [2021-11-07 10:34:25,984 INFO L858 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-11-07 10:34:25,985 INFO L858 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-11-07 10:34:25,985 INFO L858 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-11-07 10:34:25,985 INFO L858 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-11-07 10:34:25,985 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-07 10:34:25,985 INFO L858 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-11-07 10:34:25,985 INFO L854 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (and (or (< 0 ULTIMATE.start_ir_init_~retval~0) (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0)) (= ~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-07 10:34:25,985 INFO L858 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,985 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,985 INFO L858 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-11-07 10:34:25,985 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,986 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-11-07 10:34:25,986 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.offset| 0)) [2021-11-07 10:34:25,986 INFO L854 garLoopResultBuilder]: At program point L5098(lines 5097 5099) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.base| 0)) (.cse5 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0))) (or (and .cse0 .cse1 (not .cse2) .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse1 .cse3 .cse2 .cse5))) [2021-11-07 10:34:25,986 INFO L854 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,986 INFO L858 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,986 INFO L858 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-11-07 10:34:25,986 INFO L858 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-11-07 10:34:25,986 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,987 INFO L858 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-11-07 10:34:25,987 INFO L858 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,987 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,987 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,987 INFO L858 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-11-07 10:34:25,987 INFO L858 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-11-07 10:34:25,987 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,987 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,987 INFO L858 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-11-07 10:34:25,988 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.offset| 0)) [2021-11-07 10:34:25,988 INFO L858 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-11-07 10:34:25,988 INFO L858 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-11-07 10:34:25,988 INFO L861 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-11-07 10:34:25,988 INFO L858 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-11-07 10:34:25,988 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.offset| 0)) [2021-11-07 10:34:25,988 INFO L854 garLoopResultBuilder]: At program point L3651(lines 3644 3653) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,988 INFO L858 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-11-07 10:34:25,988 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.offset| 0)) [2021-11-07 10:34:25,989 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,989 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,990 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,990 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 10:34:25,990 INFO L858 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-11-07 10:34:25,990 INFO L858 garLoopResultBuilder]: For program point L4909-2(lines 5053 5058) no Hoare annotation was computed. [2021-11-07 10:34:25,990 INFO L861 garLoopResultBuilder]: At program point L4909-3(lines 5044 5061) the Hoare annotation is: true [2021-11-07 10:34:25,991 INFO L858 garLoopResultBuilder]: For program point L4909(lines 1 5156) no Hoare annotation was computed. [2021-11-07 10:34:25,991 INFO L858 garLoopResultBuilder]: For program point L4909-1(lines 1 5156) no Hoare annotation was computed. [2021-11-07 10:34:25,991 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-07 10:34:25,991 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,992 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.offset| 0)) [2021-11-07 10:34:25,992 INFO L858 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-11-07 10:34:25,992 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,993 INFO L858 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-11-07 10:34:25,993 INFO L858 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-11-07 10:34:25,993 INFO L858 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-11-07 10:34:25,995 INFO L858 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-11-07 10:34:25,995 INFO L858 garLoopResultBuilder]: For program point L4912-1(line 4912) no Hoare annotation was computed. [2021-11-07 10:34:25,996 INFO L858 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-11-07 10:34:25,996 INFO L858 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2021-11-07 10:34:25,996 INFO L858 garLoopResultBuilder]: For program point L4912(line 4912) no Hoare annotation was computed. [2021-11-07 10:34:25,996 INFO L858 garLoopResultBuilder]: For program point L4912-3(line 4912) no Hoare annotation was computed. [2021-11-07 10:34:25,996 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,996 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,999 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.offset| 0)) [2021-11-07 10:34:25,999 INFO L858 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-11-07 10:34:25,999 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) .cse1))) [2021-11-07 10:34:25,999 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:25,999 INFO L858 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-11-07 10:34:25,999 INFO L854 garLoopResultBuilder]: At program point L3726(lines 3723 3728) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) [2021-11-07 10:34:25,999 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.offset| 0)) [2021-11-07 10:34:26,000 INFO L858 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-11-07 10:34:26,000 INFO L858 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-11-07 10:34:26,001 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:26,001 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.offset| 0)) [2021-11-07 10:34:26,001 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-07 10:34:26,001 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:26,001 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) (= ULTIMATE.start_ir_xbof_change_~xbof___0 0) .cse1))) [2021-11-07 10:34:26,001 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.offset| 0)) [2021-11-07 10:34:26,001 INFO L858 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-11-07 10:34:26,001 INFO L858 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-11-07 10:34:26,002 INFO L858 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-11-07 10:34:26,002 INFO L858 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-11-07 10:34:26,002 INFO L858 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-11-07 10:34:26,002 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.offset| 0)) [2021-11-07 10:34:26,002 INFO L858 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-11-07 10:34:26,002 INFO L858 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-11-07 10:34:26,002 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.offset| 0)) [2021-11-07 10:34:26,002 INFO L861 garLoopResultBuilder]: At program point L4921(lines 4921 4922) the Hoare annotation is: true [2021-11-07 10:34:26,002 INFO L861 garLoopResultBuilder]: At program point L4921-1(lines 4921 4922) the Hoare annotation is: true [2021-11-07 10:34:26,003 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:26,015 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 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (and .cse0 (= ~ir_add_bof~0 0) .cse1))) [2021-11-07 10:34:26,015 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.offset| 0)) [2021-11-07 10:34:26,016 INFO L858 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-11-07 10:34:26,017 INFO L858 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-11-07 10:34:26,017 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.offset| 0)) [2021-11-07 10:34:26,020 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 10:34:26,021 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 10:34:26,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:34:26 BoogieIcfgContainer [2021-11-07 10:34:26,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 10:34:26,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 10:34:26,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 10:34:26,080 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 10:34:26,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:44" (3/4) ... [2021-11-07 10:34:26,083 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 10:34:26,106 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 138 nodes and edges [2021-11-07 10:34:26,107 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2021-11-07 10:34:26,109 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-11-07 10:34:26,110 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-11-07 10:34:26,111 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-07 10:34:26,112 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-07 10:34:26,113 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 10:34:26,114 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 10:34:26,139 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,140 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_coherent_state == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && urb == 0) && \result == 0) && \result == 0) || (((((((ldv_coherent_state == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || ((((((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(\result == 0)) && !(\result == 0)) && ldv_urb_state <= 1) && !(arbitrary_memory == 0)) && \result == 0) && !(\result == 0)) && \result == 0) [2021-11-07 10:34:26,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_coherent_state == 0 && \result == 0) && !(\result == 0)) && ldv_urb_state == 0) && !(\result == 0)) && \result == 0) || (((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-11-07 10:34:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && urb == 0) && \result == 0) && \result == 0 [2021-11-07 10:34:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,150 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 [2021-11-07 10:34:26,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-11-07 10:34:26,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-11-07 10:34:26,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 [2021-11-07 10:34:26,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && urb == 0) && \result == 0) && \result == 0 [2021-11-07 10:34:26,307 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-07 10:34:26,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 10:34:26,308 INFO L158 Benchmark]: Toolchain (without parser) took 46800.12ms. Allocated memory was 104.9MB in the beginning and 866.1MB in the end (delta: 761.3MB). Free memory was 70.2MB in the beginning and 517.3MB in the end (delta: -447.1MB). Peak memory consumption was 310.7MB. Max. memory is 16.1GB. [2021-11-07 10:34:26,308 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 10:34:26,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 930.98ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 70.2MB in the beginning and 70.6MB in the end (delta: -408.4kB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2021-11-07 10:34:26,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.71ms. Allocated memory is still 134.2MB. Free memory was 70.6MB in the beginning and 60.8MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-07 10:34:26,309 INFO L158 Benchmark]: Boogie Preprocessor took 136.20ms. Allocated memory is still 134.2MB. Free memory was 60.8MB in the beginning and 86.8MB in the end (delta: -26.0MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2021-11-07 10:34:26,309 INFO L158 Benchmark]: RCFGBuilder took 3849.61ms. Allocated memory was 134.2MB in the beginning and 228.6MB in the end (delta: 94.4MB). Free memory was 86.8MB in the beginning and 63.5MB in the end (delta: 23.3MB). Peak memory consumption was 134.6MB. Max. memory is 16.1GB. [2021-11-07 10:34:26,310 INFO L158 Benchmark]: TraceAbstraction took 41540.72ms. Allocated memory was 228.6MB in the beginning and 866.1MB in the end (delta: 637.5MB). Free memory was 62.5MB in the beginning and 662.0MB in the end (delta: -599.5MB). Peak memory consumption was 416.6MB. Max. memory is 16.1GB. [2021-11-07 10:34:26,310 INFO L158 Benchmark]: Witness Printer took 227.36ms. Allocated memory is still 866.1MB. Free memory was 662.0MB in the beginning and 517.3MB in the end (delta: 144.7MB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB. [2021-11-07 10:34:26,313 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 930.98ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 70.2MB in the beginning and 70.6MB in the end (delta: -408.4kB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.71ms. Allocated memory is still 134.2MB. Free memory was 70.6MB in the beginning and 60.8MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.20ms. Allocated memory is still 134.2MB. Free memory was 60.8MB in the beginning and 86.8MB in the end (delta: -26.0MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * RCFGBuilder took 3849.61ms. Allocated memory was 134.2MB in the beginning and 228.6MB in the end (delta: 94.4MB). Free memory was 86.8MB in the beginning and 63.5MB in the end (delta: 23.3MB). Peak memory consumption was 134.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41540.72ms. Allocated memory was 228.6MB in the beginning and 866.1MB in the end (delta: 637.5MB). Free memory was 62.5MB in the beginning and 662.0MB in the end (delta: -599.5MB). Peak memory consumption was 416.6MB. Max. memory is 16.1GB. * Witness Printer took 227.36ms. Allocated memory is still 866.1MB. Free memory was 662.0MB in the beginning and 517.3MB in the end (delta: 144.7MB). Peak memory consumption was 142.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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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, 279 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 41446.14ms, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 18.67ms, AutomataDifference: 7113.54ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 30977.84ms, InitialAbstractionConstructionTime: 8.21ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 9763 SdHoareTripleChecker+Valid, 5370.44ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9763 mSDsluCounter, 22433 SdHoareTripleChecker+Invalid, 5026.71ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14839 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 800 IncrementalHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 7594 mSDtfsCounter, 800 mSolverCounterSat, 40.20ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 351.19ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2687occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 955.23ms AutomataMinimizationTime, 13 MinimizatonAttempts, 10556 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 913 NumberOfFragments, 2304 HoareAnnotationTreeSize, 128 FomulaSimplifications, 342172 FormulaSimplificationTreeSizeReduction, 12546.06ms HoareSimplificationTime, 128 FomulaSimplificationsInter, 1061144 FormulaSimplificationTreeSizeReductionInter, 18360.38ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 122.15ms SsaConstructionTime, 1096.99ms SatisfiabilityAnalysisTime, 870.10ms InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 1416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 24/24 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5111]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5142]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3619]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 3723]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 4333]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4332]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5150]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 4294]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4514]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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: 1]: Loop Invariant Derived loop invariant: ((((((0 < retval || retval + 1 <= 0) && 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: 4489]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && \result == 0) && !(\result == 0)) && ldv_urb_state == 0) && !(\result == 0)) && \result == 0) || (((((\result == 0 && ldv_coherent_state == 0) && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 5104]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5121]: 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5067]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4823]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3818]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 5081]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4510]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4860]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 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 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && urb == 0) && \result == 0) && \result == 0 - 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5044]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4277]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4843]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 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: 5047]: 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: 1]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - InvariantResult [Line: 4987]: Loop Invariant Derived loop invariant: (((((((((ldv_coherent_state == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && \result == 0) && urb == 0) && \result == 0) && \result == 0) || (((((((ldv_coherent_state == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || ((((((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(\result == 0)) && !(\result == 0)) && ldv_urb_state <= 1) && !(arbitrary_memory == 0)) && \result == 0) && !(\result == 0)) && \result == 0) - 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: ((((((0 < retval || retval + 1 <= 0) && 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: 5017]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && urb == 0) && \result == 0) && \result == 0 - 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5072]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 4507]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3729]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - 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 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4504]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 3699]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && \result == 0) && 1 <= ldv_urb_state) && arbitrary_memory == 0) && urb == 0) && ldv_urb_state <= 1) && \result == 0) && \result == 0 - 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: 4846]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || ((ldv_coherent_state == 0 && ir_add_bof == 0) && ldv_urb_state == 0) - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result == 0) || (((ldv_coherent_state == 0 && ir_add_bof == 0) && xbof___0 == 0) && ldv_urb_state == 0) RESULT: Ultimate proved your program to be correct! [2021-11-07 10:34:26,393 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