./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.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 5ad15ea2ee4e38087fdbbd25111673bb935102e85f8e91f44e32009dacc41114 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:30:42,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:30:42,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:30:42,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:30:42,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:30:42,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:30:42,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:30:42,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:30:42,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:30:42,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:30:42,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:30:42,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:30:42,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:30:42,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:30:42,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:30:42,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:30:42,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:30:42,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:30:42,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:30:42,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:30:42,985 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:30:42,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:30:42,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:30:42,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:30:42,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:30:42,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:30:42,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:30:42,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:30:42,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:30:42,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:30:42,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:30:42,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:30:42,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:30:42,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:30:42,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:30:42,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:30:42,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:30:42,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:30:42,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:30:42,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:30:43,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:30:43,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:30:43,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:30:43,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:30:43,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:30:43,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:30:43,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:30:43,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:30:43,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:30:43,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:30:43,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:30:43,031 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:30:43,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:30:43,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:30:43,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:30:43,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:30:43,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:30:43,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:30:43,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:30:43,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:30:43,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:30:43,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:30:43,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:30:43,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:30:43,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:30:43,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:30:43,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:30:43,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:30:43,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:30:43,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:30:43,035 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:30:43,035 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:30:43,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:30:43,035 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 -> 5ad15ea2ee4e38087fdbbd25111673bb935102e85f8e91f44e32009dacc41114 [2022-07-12 12:30:43,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:30:43,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:30:43,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:30:43,246 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:30:43,246 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:30:43,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i [2022-07-12 12:30:43,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acfd2ca65/d47d8665b5c947a28aed7750aef6cf82/FLAGe4c5605f0 [2022-07-12 12:30:43,801 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:30:43,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i [2022-07-12 12:30:43,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acfd2ca65/d47d8665b5c947a28aed7750aef6cf82/FLAGe4c5605f0 [2022-07-12 12:30:44,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acfd2ca65/d47d8665b5c947a28aed7750aef6cf82 [2022-07-12 12:30:44,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:30:44,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:30:44,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:30:44,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:30:44,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:30:44,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:30:44" (1/1) ... [2022-07-12 12:30:44,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237c8305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:44, skipping insertion in model container [2022-07-12 12:30:44,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:30:44" (1/1) ... [2022-07-12 12:30:44,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:30:44,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:30:44,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i[161556,161569] [2022-07-12 12:30:45,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:30:45,127 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:30:45,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i[161556,161569] [2022-07-12 12:30:45,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:30:45,360 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:30:45,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45 WrapperNode [2022-07-12 12:30:45,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:30:45,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:30:45,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:30:45,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:30:45,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,472 INFO L137 Inliner]: procedures = 125, calls = 327, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1066 [2022-07-12 12:30:45,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:30:45,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:30:45,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:30:45,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:30:45,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:30:45,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:30:45,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:30:45,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:30:45,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (1/1) ... [2022-07-12 12:30:45,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:30:45,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:30:45,591 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) [2022-07-12 12:30:45,609 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 [2022-07-12 12:30:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:30:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:30:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:30:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:30:45,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:30:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:30:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-07-12 12:30:45,622 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-07-12 12:30:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-12 12:30:45,622 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-12 12:30:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure skb_clone [2022-07-12 12:30:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_clone [2022-07-12 12:30:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-12 12:30:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-12 12:30:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:30:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:30:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-12 12:30:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-12 12:30:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:30:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:30:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:30:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-12 12:30:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-12 12:30:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:30:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:30:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure put_unaligned_le16 [2022-07-12 12:30:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure put_unaligned_le16 [2022-07-12 12:30:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:30:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:30:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:30:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:30:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure eem_rx_fixup [2022-07-12 12:30:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure eem_rx_fixup [2022-07-12 12:30:45,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:30:45,628 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-12 12:30:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-12 12:30:45,628 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-12 12:30:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-12 12:30:45,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:30:45,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:30:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:30:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:30:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-12 12:30:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-12 12:30:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 12:30:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 12:30:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:30:45,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:30:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 12:30:45,630 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 12:30:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:30:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:30:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:30:45,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:30:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:30:45,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:30:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure eem_tx_fixup [2022-07-12 12:30:45,632 INFO L138 BoogieDeclarations]: Found implementation of procedure eem_tx_fixup [2022-07-12 12:30:45,900 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:30:45,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:30:45,962 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:30:47,015 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:30:47,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:30:47,022 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 12:30:47,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:30:47 BoogieIcfgContainer [2022-07-12 12:30:47,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:30:47,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:30:47,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:30:47,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:30:47,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:30:44" (1/3) ... [2022-07-12 12:30:47,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48294b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:30:47, skipping insertion in model container [2022-07-12 12:30:47,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:30:45" (2/3) ... [2022-07-12 12:30:47,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48294b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:30:47, skipping insertion in model container [2022-07-12 12:30:47,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:30:47" (3/3) ... [2022-07-12 12:30:47,029 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i [2022-07-12 12:30:47,042 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:30:47,042 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:30:47,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:30:47,103 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15ab80d3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21163f6b [2022-07-12 12:30:47,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:30:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 331 states, 260 states have (on average 1.4076923076923078) internal successors, (366), 269 states have internal predecessors, (366), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-07-12 12:30:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 12:30:47,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:47,119 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:47,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2123580828, now seen corresponding path program 1 times [2022-07-12 12:30:47,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:47,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760326017] [2022-07-12 12:30:47,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:47,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:47,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 12:30:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:47,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 12:30:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 12:30:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:47,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760326017] [2022-07-12 12:30:47,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760326017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:47,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:47,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:30:47,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228005717] [2022-07-12 12:30:47,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:47,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:30:47,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:47,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:30:47,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:30:47,567 INFO L87 Difference]: Start difference. First operand has 331 states, 260 states have (on average 1.4076923076923078) internal successors, (366), 269 states have internal predecessors, (366), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:30:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:49,308 INFO L93 Difference]: Finished difference Result 1152 states and 1717 transitions. [2022-07-12 12:30:49,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:30:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-07-12 12:30:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:49,326 INFO L225 Difference]: With dead ends: 1152 [2022-07-12 12:30:49,326 INFO L226 Difference]: Without dead ends: 762 [2022-07-12 12:30:49,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:30:49,335 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 960 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:49,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1180 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 12:30:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-07-12 12:30:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 553. [2022-07-12 12:30:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 453 states have internal predecessors, (602), 68 states have call successors, (68), 36 states have call predecessors, (68), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-07-12 12:30:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 737 transitions. [2022-07-12 12:30:49,403 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 737 transitions. Word has length 42 [2022-07-12 12:30:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:49,403 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 737 transitions. [2022-07-12 12:30:49,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:30:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 737 transitions. [2022-07-12 12:30:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 12:30:49,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:49,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:49,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:30:49,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:49,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 653867414, now seen corresponding path program 1 times [2022-07-12 12:30:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:49,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441709562] [2022-07-12 12:30:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 12:30:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:49,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 12:30:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:30:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 12:30:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:49,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441709562] [2022-07-12 12:30:49,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441709562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:49,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:49,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:30:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105168119] [2022-07-12 12:30:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:49,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:30:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:49,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:30:49,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:30:49,611 INFO L87 Difference]: Start difference. First operand 553 states and 737 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 12:30:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:51,006 INFO L93 Difference]: Finished difference Result 1497 states and 2083 transitions. [2022-07-12 12:30:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:30:51,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-12 12:30:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:51,014 INFO L225 Difference]: With dead ends: 1497 [2022-07-12 12:30:51,014 INFO L226 Difference]: Without dead ends: 1488 [2022-07-12 12:30:51,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:30:51,016 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 920 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:51,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1680 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 12:30:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-12 12:30:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1219. [2022-07-12 12:30:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 998 states have (on average 1.3507014028056112) internal successors, (1348), 1008 states have internal predecessors, (1348), 149 states have call successors, (149), 70 states have call predecessors, (149), 71 states have return successors, (160), 148 states have call predecessors, (160), 148 states have call successors, (160) [2022-07-12 12:30:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1657 transitions. [2022-07-12 12:30:51,093 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1657 transitions. Word has length 52 [2022-07-12 12:30:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:51,093 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1657 transitions. [2022-07-12 12:30:51,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 12:30:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1657 transitions. [2022-07-12 12:30:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 12:30:51,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:51,105 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:51,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:30:51,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:51,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2008058537, now seen corresponding path program 1 times [2022-07-12 12:30:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:51,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665956656] [2022-07-12 12:30:51,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 12:30:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 12:30:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:30:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:30:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:30:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:30:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:30:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:30:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:30:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:30:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:30:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:30:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 12:30:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 12:30:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:51,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665956656] [2022-07-12 12:30:51,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665956656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:51,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:51,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:30:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544924506] [2022-07-12 12:30:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:51,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:30:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:30:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:30:51,370 INFO L87 Difference]: Start difference. First operand 1219 states and 1657 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:30:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:53,190 INFO L93 Difference]: Finished difference Result 2919 states and 4033 transitions. [2022-07-12 12:30:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:30:53,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2022-07-12 12:30:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:53,199 INFO L225 Difference]: With dead ends: 2919 [2022-07-12 12:30:53,199 INFO L226 Difference]: Without dead ends: 1716 [2022-07-12 12:30:53,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:30:53,202 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 471 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:53,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1479 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 12:30:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-07-12 12:30:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1448. [2022-07-12 12:30:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1200 states have (on average 1.3708333333333333) internal successors, (1645), 1212 states have internal predecessors, (1645), 162 states have call successors, (162), 80 states have call predecessors, (162), 85 states have return successors, (177), 163 states have call predecessors, (177), 161 states have call successors, (177) [2022-07-12 12:30:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1984 transitions. [2022-07-12 12:30:53,248 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1984 transitions. Word has length 162 [2022-07-12 12:30:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:53,248 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 1984 transitions. [2022-07-12 12:30:53,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:30:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1984 transitions. [2022-07-12 12:30:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-12 12:30:53,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:53,252 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:53,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:30:53,252 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1866479413, now seen corresponding path program 1 times [2022-07-12 12:30:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:53,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862024263] [2022-07-12 12:30:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 12:30:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 12:30:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:30:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:30:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:30:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:30:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:30:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:30:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:30:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:30:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:30:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:30:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:30:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:30:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:30:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-12 12:30:53,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:53,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862024263] [2022-07-12 12:30:53,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862024263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:53,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:30:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296157074] [2022-07-12 12:30:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:53,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:30:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:30:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:30:53,526 INFO L87 Difference]: Start difference. First operand 1448 states and 1984 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 12:30:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:55,896 INFO L93 Difference]: Finished difference Result 4491 states and 6219 transitions. [2022-07-12 12:30:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:30:55,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 184 [2022-07-12 12:30:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:55,910 INFO L225 Difference]: With dead ends: 4491 [2022-07-12 12:30:55,910 INFO L226 Difference]: Without dead ends: 3070 [2022-07-12 12:30:55,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:30:55,918 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 967 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:55,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1487 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 12:30:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2022-07-12 12:30:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 2556. [2022-07-12 12:30:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2114 states have (on average 1.3571428571428572) internal successors, (2869), 2138 states have internal predecessors, (2869), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-07-12 12:30:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3460 transitions. [2022-07-12 12:30:56,000 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3460 transitions. Word has length 184 [2022-07-12 12:30:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:56,001 INFO L495 AbstractCegarLoop]: Abstraction has 2556 states and 3460 transitions. [2022-07-12 12:30:56,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 12:30:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3460 transitions. [2022-07-12 12:30:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-12 12:30:56,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:56,005 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:56,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:30:56,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1671695385, now seen corresponding path program 1 times [2022-07-12 12:30:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:56,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566102540] [2022-07-12 12:30:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 12:30:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 12:30:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:30:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:30:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:30:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 12:30:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:30:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:30:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:30:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:30:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:30:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:30:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:30:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:30:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:30:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 12:30:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:56,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566102540] [2022-07-12 12:30:56,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566102540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:56,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:56,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:30:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24975167] [2022-07-12 12:30:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:56,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:30:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:30:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:30:56,303 INFO L87 Difference]: Start difference. First operand 2556 states and 3460 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:30:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:57,834 INFO L93 Difference]: Finished difference Result 4500 states and 6218 transitions. [2022-07-12 12:30:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:30:57,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2022-07-12 12:30:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:57,849 INFO L225 Difference]: With dead ends: 4500 [2022-07-12 12:30:57,849 INFO L226 Difference]: Without dead ends: 3069 [2022-07-12 12:30:57,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:30:57,857 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 368 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:57,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1323 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 12:30:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-07-12 12:30:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2564. [2022-07-12 12:30:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2122 states have (on average 1.3557964184731386) internal successors, (2877), 2146 states have internal predecessors, (2877), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-07-12 12:30:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3468 transitions. [2022-07-12 12:30:57,969 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3468 transitions. Word has length 184 [2022-07-12 12:30:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:57,970 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3468 transitions. [2022-07-12 12:30:57,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:30:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3468 transitions. [2022-07-12 12:30:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-12 12:30:57,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:57,974 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:57,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:30:57,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1475470648, now seen corresponding path program 1 times [2022-07-12 12:30:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:57,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997321947] [2022-07-12 12:30:57,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 12:30:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 12:30:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:30:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:30:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:30:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 12:30:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 12:30:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:30:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:30:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:30:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:30:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:30:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:30:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:30:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:30:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 12:30:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:58,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997321947] [2022-07-12 12:30:58,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997321947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:58,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:58,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 12:30:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750403059] [2022-07-12 12:30:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:58,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 12:30:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 12:30:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:30:58,354 INFO L87 Difference]: Start difference. First operand 2564 states and 3468 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-12 12:31:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:01,645 INFO L93 Difference]: Finished difference Result 4039 states and 5526 transitions. [2022-07-12 12:31:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:31:01,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) Word has length 186 [2022-07-12 12:31:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:01,647 INFO L225 Difference]: With dead ends: 4039 [2022-07-12 12:31:01,647 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 12:31:01,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:31:01,655 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 996 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:01,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1463 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 12:31:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 12:31:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 12:31:01,656 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) [2022-07-12 12:31:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 12:31:01,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2022-07-12 12:31:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:01,657 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 12:31:01,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-12 12:31:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 12:31:01,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 12:31:01,659 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 12:31:01,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:31:01,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 12:31:05,423 INFO L902 garLoopResultBuilder]: At program point skb_putENTRY(lines 6624 6628) the Hoare annotation is: true [2022-07-12 12:31:05,423 INFO L899 garLoopResultBuilder]: For program point skb_putFINAL(lines 6624 6628) no Hoare annotation was computed. [2022-07-12 12:31:05,423 INFO L899 garLoopResultBuilder]: For program point skb_putEXIT(lines 6624 6628) no Hoare annotation was computed. [2022-07-12 12:31:05,423 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 5677 5683) no Hoare annotation was computed. [2022-07-12 12:31:05,424 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 5677 5683) the Hoare annotation is: true [2022-07-12 12:31:05,424 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5681) no Hoare annotation was computed. [2022-07-12 12:31:05,424 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 5677 5683) no Hoare annotation was computed. [2022-07-12 12:31:05,424 INFO L899 garLoopResultBuilder]: For program point L6619-1(line 6619) no Hoare annotation was computed. [2022-07-12 12:31:05,424 INFO L895 garLoopResultBuilder]: At program point skb_pullENTRY(lines 6618 6620) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,424 INFO L895 garLoopResultBuilder]: At program point L6619(line 6619) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,424 INFO L899 garLoopResultBuilder]: For program point skb_pullFINAL(lines 6618 6620) no Hoare annotation was computed. [2022-07-12 12:31:05,425 INFO L899 garLoopResultBuilder]: For program point skb_pullEXIT(lines 6618 6620) no Hoare annotation was computed. [2022-07-12 12:31:05,425 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5684 5690) no Hoare annotation was computed. [2022-07-12 12:31:05,425 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5684 5690) the Hoare annotation is: true [2022-07-12 12:31:05,425 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 5691 5696) no Hoare annotation was computed. [2022-07-12 12:31:05,425 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 5691 5696) the Hoare annotation is: true [2022-07-12 12:31:05,426 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 5691 5696) no Hoare annotation was computed. [2022-07-12 12:31:05,426 INFO L902 garLoopResultBuilder]: At program point usbnet_disconnectENTRY(lines 6655 6657) the Hoare annotation is: true [2022-07-12 12:31:05,426 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectFINAL(lines 6655 6657) no Hoare annotation was computed. [2022-07-12 12:31:05,426 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectEXIT(lines 6655 6657) no Hoare annotation was computed. [2022-07-12 12:31:05,426 INFO L895 garLoopResultBuilder]: At program point put_unaligned_le16ENTRY(lines 5748 5754) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~last_index~0 0))) [2022-07-12 12:31:05,426 INFO L899 garLoopResultBuilder]: For program point put_unaligned_le16FINAL(lines 5748 5754) no Hoare annotation was computed. [2022-07-12 12:31:05,426 INFO L899 garLoopResultBuilder]: For program point put_unaligned_le16EXIT(lines 5748 5754) no Hoare annotation was computed. [2022-07-12 12:31:05,427 INFO L895 garLoopResultBuilder]: At program point L6622(line 6622) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,427 INFO L899 garLoopResultBuilder]: For program point skb_pushFINAL(lines 6621 6623) no Hoare annotation was computed. [2022-07-12 12:31:05,427 INFO L899 garLoopResultBuilder]: For program point L6622-1(line 6622) no Hoare annotation was computed. [2022-07-12 12:31:05,427 INFO L895 garLoopResultBuilder]: At program point skb_pushENTRY(lines 6621 6623) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,427 INFO L899 garLoopResultBuilder]: For program point skb_pushEXIT(lines 6621 6623) no Hoare annotation was computed. [2022-07-12 12:31:05,427 INFO L899 garLoopResultBuilder]: For program point L6433-1(lines 6433 6436) no Hoare annotation was computed. [2022-07-12 12:31:05,427 INFO L899 garLoopResultBuilder]: For program point L6433(lines 6433 6436) no Hoare annotation was computed. [2022-07-12 12:31:05,427 INFO L899 garLoopResultBuilder]: For program point L6423(lines 6423 6427) no Hoare annotation was computed. [2022-07-12 12:31:05,428 INFO L899 garLoopResultBuilder]: For program point L6419-1(lines 6419 6422) no Hoare annotation was computed. [2022-07-12 12:31:05,428 INFO L899 garLoopResultBuilder]: For program point L6419(lines 6419 6422) no Hoare annotation was computed. [2022-07-12 12:31:05,428 INFO L895 garLoopResultBuilder]: At program point L6432-2(lines 6432 6439) the Hoare annotation is: (not (= |old(~last_index~0)| 0)) [2022-07-12 12:31:05,428 INFO L895 garLoopResultBuilder]: At program point ldv_set_removeENTRY(lines 6411 6445) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-07-12 12:31:05,428 INFO L899 garLoopResultBuilder]: For program point L6432-3(lines 6432 6439) no Hoare annotation was computed. [2022-07-12 12:31:05,428 INFO L899 garLoopResultBuilder]: For program point L6430-1(lines 6411 6445) no Hoare annotation was computed. [2022-07-12 12:31:05,428 INFO L899 garLoopResultBuilder]: For program point L6418-3(lines 6415 6444) no Hoare annotation was computed. [2022-07-12 12:31:05,428 INFO L895 garLoopResultBuilder]: At program point L6418-2(lines 6418 6429) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (+ ldv_set_remove_~deleted_index~0 1)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))) [2022-07-12 12:31:05,428 INFO L899 garLoopResultBuilder]: For program point ldv_set_removeEXIT(lines 6411 6445) no Hoare annotation was computed. [2022-07-12 12:31:05,429 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2022-07-12 12:31:05,429 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-12 12:31:05,430 INFO L895 garLoopResultBuilder]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~last_index~0 0)) (not (= ~ldv_state_variable_2~0 0))) [2022-07-12 12:31:05,430 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2022-07-12 12:31:05,430 INFO L899 garLoopResultBuilder]: For program point skb_cloneFINAL(lines 6612 6614) no Hoare annotation was computed. [2022-07-12 12:31:05,430 INFO L899 garLoopResultBuilder]: For program point skb_cloneEXIT(lines 6612 6614) no Hoare annotation was computed. [2022-07-12 12:31:05,430 INFO L895 garLoopResultBuilder]: At program point skb_cloneENTRY(lines 6612 6614) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,430 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-07-12 12:31:05,430 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,430 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5624 5626) the Hoare annotation is: true [2022-07-12 12:31:05,431 INFO L899 garLoopResultBuilder]: For program point L5625-2(lines 5624 5626) no Hoare annotation was computed. [2022-07-12 12:31:05,431 INFO L899 garLoopResultBuilder]: For program point L5625(line 5625) no Hoare annotation was computed. [2022-07-12 12:31:05,431 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5624 5626) no Hoare annotation was computed. [2022-07-12 12:31:05,431 INFO L895 garLoopResultBuilder]: At program point ldv_skb_freeENTRY(lines 6532 6538) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-07-12 12:31:05,431 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeFINAL(lines 6532 6538) no Hoare annotation was computed. [2022-07-12 12:31:05,432 INFO L895 garLoopResultBuilder]: At program point L6535(line 6535) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-07-12 12:31:05,432 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeEXIT(lines 6532 6538) no Hoare annotation was computed. [2022-07-12 12:31:05,432 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 6641 6643) no Hoare annotation was computed. [2022-07-12 12:31:05,432 INFO L902 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 6641 6643) the Hoare annotation is: true [2022-07-12 12:31:05,433 INFO L899 garLoopResultBuilder]: For program point usb_free_urbFINAL(lines 6641 6643) no Hoare annotation was computed. [2022-07-12 12:31:05,433 INFO L895 garLoopResultBuilder]: At program point L6031(line 6031) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,433 INFO L899 garLoopResultBuilder]: For program point L6031-1(line 6031) no Hoare annotation was computed. [2022-07-12 12:31:05,433 INFO L895 garLoopResultBuilder]: At program point eem_rx_fixupENTRY(lines 5926 6059) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))) [2022-07-12 12:31:05,433 INFO L899 garLoopResultBuilder]: For program point L5833(line 5833) no Hoare annotation was computed. [2022-07-12 12:31:05,433 INFO L899 garLoopResultBuilder]: For program point L6032(line 6032) no Hoare annotation was computed. [2022-07-12 12:31:05,434 INFO L895 garLoopResultBuilder]: At program point L5951(line 5951) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,434 INFO L895 garLoopResultBuilder]: At program point L5984-1(line 5984) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,434 INFO L899 garLoopResultBuilder]: For program point L5951-1(line 5951) no Hoare annotation was computed. [2022-07-12 12:31:05,434 INFO L895 garLoopResultBuilder]: At program point L5984(line 5984) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,434 INFO L895 garLoopResultBuilder]: At program point L5737(lines 5732 5739) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,434 INFO L899 garLoopResultBuilder]: For program point L6051(line 6051) no Hoare annotation was computed. [2022-07-12 12:31:05,434 INFO L899 garLoopResultBuilder]: For program point L6018(lines 6018 6028) no Hoare annotation was computed. [2022-07-12 12:31:05,434 INFO L895 garLoopResultBuilder]: At program point L5506(lines 5501 5508) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,434 INFO L899 garLoopResultBuilder]: For program point L5985(line 5985) no Hoare annotation was computed. [2022-07-12 12:31:05,435 INFO L899 garLoopResultBuilder]: For program point L5952(lines 5952 6049) no Hoare annotation was computed. [2022-07-12 12:31:05,435 INFO L899 garLoopResultBuilder]: For program point L6018-2(lines 6003 6049) no Hoare annotation was computed. [2022-07-12 12:31:05,435 INFO L895 garLoopResultBuilder]: At program point L5787(lines 5775 5789) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,435 INFO L895 garLoopResultBuilder]: At program point L5490(lines 5486 5492) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,435 INFO L899 garLoopResultBuilder]: For program point L5969-2(line 5969) no Hoare annotation was computed. [2022-07-12 12:31:05,435 INFO L899 garLoopResultBuilder]: For program point L5969(line 5969) no Hoare annotation was computed. [2022-07-12 12:31:05,435 INFO L899 garLoopResultBuilder]: For program point L5969-6(line 5969) no Hoare annotation was computed. [2022-07-12 12:31:05,435 INFO L899 garLoopResultBuilder]: For program point L5969-4(line 5969) no Hoare annotation was computed. [2022-07-12 12:31:05,435 INFO L899 garLoopResultBuilder]: For program point eem_rx_fixupEXIT(lines 5926 6059) no Hoare annotation was computed. [2022-07-12 12:31:05,436 INFO L899 garLoopResultBuilder]: For program point L5969-8(line 5969) no Hoare annotation was computed. [2022-07-12 12:31:05,436 INFO L895 garLoopResultBuilder]: At program point L5986(line 5986) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,436 INFO L895 garLoopResultBuilder]: At program point L6052(lines 5942 6058) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,436 INFO L899 garLoopResultBuilder]: For program point L5953(lines 5953 5968) no Hoare annotation was computed. [2022-07-12 12:31:05,436 INFO L899 garLoopResultBuilder]: For program point L5986-1(line 5986) no Hoare annotation was computed. [2022-07-12 12:31:05,436 INFO L899 garLoopResultBuilder]: For program point L5970(lines 5970 6001) no Hoare annotation was computed. [2022-07-12 12:31:05,437 INFO L895 garLoopResultBuilder]: At program point L5838(lines 5817 5840) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,437 INFO L899 garLoopResultBuilder]: For program point L6053(lines 6053 6056) no Hoare annotation was computed. [2022-07-12 12:31:05,437 INFO L899 garLoopResultBuilder]: For program point L5971(line 5971) no Hoare annotation was computed. [2022-07-12 12:31:05,437 INFO L899 garLoopResultBuilder]: For program point L6037(lines 6003 6049) no Hoare annotation was computed. [2022-07-12 12:31:05,437 INFO L899 garLoopResultBuilder]: For program point L6004(lines 6004 6007) no Hoare annotation was computed. [2022-07-12 12:31:05,437 INFO L895 garLoopResultBuilder]: At program point L6054(lines 5942 6058) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,438 INFO L895 garLoopResultBuilder]: At program point L6021(line 6021) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,438 INFO L899 garLoopResultBuilder]: For program point L6021-1(line 6021) no Hoare annotation was computed. [2022-07-12 12:31:05,438 INFO L899 garLoopResultBuilder]: For program point L5823(lines 5823 5826) no Hoare annotation was computed. [2022-07-12 12:31:05,438 INFO L895 garLoopResultBuilder]: At program point L5526(lines 5521 5528) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,438 INFO L899 garLoopResultBuilder]: For program point L5972-2(line 5972) no Hoare annotation was computed. [2022-07-12 12:31:05,438 INFO L899 garLoopResultBuilder]: For program point L5972(line 5972) no Hoare annotation was computed. [2022-07-12 12:31:05,438 INFO L899 garLoopResultBuilder]: For program point L5972-6(line 5972) no Hoare annotation was computed. [2022-07-12 12:31:05,438 INFO L899 garLoopResultBuilder]: For program point L5972-4(line 5972) no Hoare annotation was computed. [2022-07-12 12:31:05,438 INFO L899 garLoopResultBuilder]: For program point L5972-8(line 5972) no Hoare annotation was computed. [2022-07-12 12:31:05,439 INFO L895 garLoopResultBuilder]: At program point L6633-2(lines 6632 6634) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,439 INFO L895 garLoopResultBuilder]: At program point L6022(lines 6022 6023) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,439 INFO L899 garLoopResultBuilder]: For program point L6633-1(line 6633) no Hoare annotation was computed. [2022-07-12 12:31:05,439 INFO L895 garLoopResultBuilder]: At program point L6633(line 6633) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,439 INFO L899 garLoopResultBuilder]: For program point L5989(line 5989) no Hoare annotation was computed. [2022-07-12 12:31:05,439 INFO L899 garLoopResultBuilder]: For program point L6022-1(lines 6022 6023) no Hoare annotation was computed. [2022-07-12 12:31:05,439 INFO L895 garLoopResultBuilder]: At program point L6650(lines 6649 6651) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,439 INFO L899 garLoopResultBuilder]: For program point L5973(lines 5973 5976) no Hoare annotation was computed. [2022-07-12 12:31:05,439 INFO L899 garLoopResultBuilder]: For program point eem_rx_fixupFINAL(lines 5926 6059) no Hoare annotation was computed. [2022-07-12 12:31:05,440 INFO L899 garLoopResultBuilder]: For program point L6024(lines 6024 6027) no Hoare annotation was computed. [2022-07-12 12:31:05,440 INFO L895 garLoopResultBuilder]: At program point L5512(lines 5509 5514) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,440 INFO L899 garLoopResultBuilder]: For program point L6008-2(line 6008) no Hoare annotation was computed. [2022-07-12 12:31:05,440 INFO L899 garLoopResultBuilder]: For program point L6008(line 6008) no Hoare annotation was computed. [2022-07-12 12:31:05,440 INFO L899 garLoopResultBuilder]: For program point L6008-6(line 6008) no Hoare annotation was computed. [2022-07-12 12:31:05,440 INFO L899 garLoopResultBuilder]: For program point L6008-4(line 6008) no Hoare annotation was computed. [2022-07-12 12:31:05,440 INFO L899 garLoopResultBuilder]: For program point L6008-8(line 6008) no Hoare annotation was computed. [2022-07-12 12:31:05,440 INFO L899 garLoopResultBuilder]: For program point L5992-2(line 5992) no Hoare annotation was computed. [2022-07-12 12:31:05,440 INFO L899 garLoopResultBuilder]: For program point L5992(line 5992) no Hoare annotation was computed. [2022-07-12 12:31:05,441 INFO L895 garLoopResultBuilder]: At program point L6042(line 6042) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,441 INFO L895 garLoopResultBuilder]: At program point L6653(lines 6652 6654) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,441 INFO L899 garLoopResultBuilder]: For program point L6009(lines 6009 6012) no Hoare annotation was computed. [2022-07-12 12:31:05,441 INFO L899 garLoopResultBuilder]: For program point L6042-1(line 6042) no Hoare annotation was computed. [2022-07-12 12:31:05,442 INFO L895 garLoopResultBuilder]: At program point L5745(lines 5740 5747) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,442 INFO L899 garLoopResultBuilder]: For program point L5960-1(line 5960) no Hoare annotation was computed. [2022-07-12 12:31:05,442 INFO L899 garLoopResultBuilder]: For program point L5993(line 5993) no Hoare annotation was computed. [2022-07-12 12:31:05,442 INFO L895 garLoopResultBuilder]: At program point L5960(line 5960) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,442 INFO L895 garLoopResultBuilder]: At program point L5729(lines 5724 5731) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,442 INFO L899 garLoopResultBuilder]: For program point L6043(lines 6043 6048) no Hoare annotation was computed. [2022-07-12 12:31:05,442 INFO L895 garLoopResultBuilder]: At program point L5498(lines 5493 5500) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,442 INFO L895 garLoopResultBuilder]: At program point L6043-1(lines 5952 6049) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,443 INFO L895 garLoopResultBuilder]: At program point L5977(line 5977) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,443 INFO L899 garLoopResultBuilder]: For program point L5977-1(line 5977) no Hoare annotation was computed. [2022-07-12 12:31:05,443 INFO L895 garLoopResultBuilder]: At program point L6671(lines 6670 6672) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,443 INFO L899 garLoopResultBuilder]: For program point L5961(lines 5961 5965) no Hoare annotation was computed. [2022-07-12 12:31:05,443 INFO L895 garLoopResultBuilder]: At program point L5978(lines 5978 5979) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,443 INFO L899 garLoopResultBuilder]: For program point L5978-1(lines 5978 5979) no Hoare annotation was computed. [2022-07-12 12:31:05,443 INFO L899 garLoopResultBuilder]: For program point L5995(line 5995) no Hoare annotation was computed. [2022-07-12 12:31:05,443 INFO L899 garLoopResultBuilder]: For program point L5830(lines 5830 5837) no Hoare annotation was computed. [2022-07-12 12:31:05,444 INFO L899 garLoopResultBuilder]: For program point L5995-2(line 5995) no Hoare annotation was computed. [2022-07-12 12:31:05,444 INFO L899 garLoopResultBuilder]: For program point L5946(lines 5946 5949) no Hoare annotation was computed. [2022-07-12 12:31:05,444 INFO L895 garLoopResultBuilder]: At program point L6045(line 6045) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,444 INFO L899 garLoopResultBuilder]: For program point L5996-2(line 5996) no Hoare annotation was computed. [2022-07-12 12:31:05,444 INFO L895 garLoopResultBuilder]: At program point L6029(lines 6029 6036) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,444 INFO L899 garLoopResultBuilder]: For program point L5996(line 5996) no Hoare annotation was computed. [2022-07-12 12:31:05,444 INFO L895 garLoopResultBuilder]: At program point L5831(line 5831) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,444 INFO L895 garLoopResultBuilder]: At program point L5831-1(lines 5821 5839) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,444 INFO L899 garLoopResultBuilder]: For program point L6013(lines 6013 6016) no Hoare annotation was computed. [2022-07-12 12:31:05,445 INFO L899 garLoopResultBuilder]: For program point L5980(lines 5980 5983) no Hoare annotation was computed. [2022-07-12 12:31:05,445 INFO L895 garLoopResultBuilder]: At program point L5518(lines 5515 5520) the Hoare annotation is: (or (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-07-12 12:31:05,445 INFO L899 garLoopResultBuilder]: For program point L5997(line 5997) no Hoare annotation was computed. [2022-07-12 12:31:05,445 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5627 5643) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,445 INFO L902 garLoopResultBuilder]: At program point L5639(line 5639) the Hoare annotation is: true [2022-07-12 12:31:05,445 INFO L899 garLoopResultBuilder]: For program point L5639-1(line 5639) no Hoare annotation was computed. [2022-07-12 12:31:05,445 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5627 5643) no Hoare annotation was computed. [2022-07-12 12:31:05,445 INFO L899 garLoopResultBuilder]: For program point L5634(lines 5634 5641) no Hoare annotation was computed. [2022-07-12 12:31:05,446 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5627 5643) no Hoare annotation was computed. [2022-07-12 12:31:05,446 INFO L899 garLoopResultBuilder]: For program point crc32_leEXIT(lines 6597 6599) no Hoare annotation was computed. [2022-07-12 12:31:05,446 INFO L902 garLoopResultBuilder]: At program point crc32_leENTRY(lines 6597 6599) the Hoare annotation is: true [2022-07-12 12:31:05,446 INFO L899 garLoopResultBuilder]: For program point crc32_leFINAL(lines 6597 6599) no Hoare annotation was computed. [2022-07-12 12:31:05,446 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 12:31:05,446 INFO L899 garLoopResultBuilder]: For program point L5656-1(line 5656) no Hoare annotation was computed. [2022-07-12 12:31:05,446 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 5644 5660) no Hoare annotation was computed. [2022-07-12 12:31:05,446 INFO L902 garLoopResultBuilder]: At program point L5656(line 5656) the Hoare annotation is: true [2022-07-12 12:31:05,446 INFO L899 garLoopResultBuilder]: For program point L5651(lines 5651 5658) no Hoare annotation was computed. [2022-07-12 12:31:05,447 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 5644 5660) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~last_index~0 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_2~0 0))) (or .cse0 (not (= ~ldv_state_variable_2~0 1)) .cse1) (or .cse0 (not (= ~ldv_state_variable_0~0 1)) .cse1))) [2022-07-12 12:31:05,447 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 5644 5660) no Hoare annotation was computed. [2022-07-12 12:31:05,447 INFO L899 garLoopResultBuilder]: For program point skb_trimEXIT(lines 6629 6631) no Hoare annotation was computed. [2022-07-12 12:31:05,447 INFO L902 garLoopResultBuilder]: At program point skb_trimENTRY(lines 6629 6631) the Hoare annotation is: true [2022-07-12 12:31:05,447 INFO L899 garLoopResultBuilder]: For program point skb_trimFINAL(lines 6629 6631) no Hoare annotation was computed. [2022-07-12 12:31:05,447 INFO L895 garLoopResultBuilder]: At program point L6675(lines 6674 6676) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,447 INFO L899 garLoopResultBuilder]: For program point L6229(lines 6229 6243) no Hoare annotation was computed. [2022-07-12 12:31:05,447 INFO L899 garLoopResultBuilder]: For program point L6279(line 6279) no Hoare annotation was computed. [2022-07-12 12:31:05,448 INFO L902 garLoopResultBuilder]: At program point L6246(line 6246) the Hoare annotation is: true [2022-07-12 12:31:05,448 INFO L899 garLoopResultBuilder]: For program point L6180(lines 6180 6187) no Hoare annotation was computed. [2022-07-12 12:31:05,448 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 12:31:05,448 INFO L895 garLoopResultBuilder]: At program point L6362(lines 6351 6364) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,449 INFO L895 garLoopResultBuilder]: At program point L6263(line 6263) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,449 INFO L899 garLoopResultBuilder]: For program point L6263-1(line 6263) no Hoare annotation was computed. [2022-07-12 12:31:05,449 INFO L899 garLoopResultBuilder]: For program point L6280-2(lines 6255 6301) no Hoare annotation was computed. [2022-07-12 12:31:05,449 INFO L899 garLoopResultBuilder]: For program point L6280(lines 6280 6284) no Hoare annotation was computed. [2022-07-12 12:31:05,449 INFO L902 garLoopResultBuilder]: At program point L6313(lines 6123 6315) the Hoare annotation is: true [2022-07-12 12:31:05,449 INFO L895 garLoopResultBuilder]: At program point L6082(lines 6077 6084) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,449 INFO L895 garLoopResultBuilder]: At program point L6660(lines 6659 6661) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,449 INFO L899 garLoopResultBuilder]: For program point L6231(lines 6231 6236) no Hoare annotation was computed. [2022-07-12 12:31:05,449 INFO L899 garLoopResultBuilder]: For program point L6165(line 6165) no Hoare annotation was computed. [2022-07-12 12:31:05,450 INFO L899 garLoopResultBuilder]: For program point L6231-2(lines 6229 6242) no Hoare annotation was computed. [2022-07-12 12:31:05,450 INFO L899 garLoopResultBuilder]: For program point L6182(lines 6182 6185) no Hoare annotation was computed. [2022-07-12 12:31:05,450 INFO L895 garLoopResultBuilder]: At program point L6281(line 6281) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,450 INFO L899 garLoopResultBuilder]: For program point L6281-1(line 6281) no Hoare annotation was computed. [2022-07-12 12:31:05,450 INFO L899 garLoopResultBuilder]: For program point L6149(lines 6149 6308) no Hoare annotation was computed. [2022-07-12 12:31:05,450 INFO L895 garLoopResultBuilder]: At program point L6529(lines 6525 6531) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-07-12 12:31:05,450 INFO L899 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2022-07-12 12:31:05,450 INFO L899 garLoopResultBuilder]: For program point L6166(lines 6166 6171) no Hoare annotation was computed. [2022-07-12 12:31:05,450 INFO L899 garLoopResultBuilder]: For program point L6166-2(lines 6153 6211) no Hoare annotation was computed. [2022-07-12 12:31:05,451 INFO L899 garLoopResultBuilder]: For program point L6150(line 6150) no Hoare annotation was computed. [2022-07-12 12:31:05,451 INFO L899 garLoopResultBuilder]: For program point L6216(line 6216) no Hoare annotation was computed. [2022-07-12 12:31:05,451 INFO L899 garLoopResultBuilder]: For program point L6299(line 6299) no Hoare annotation was computed. [2022-07-12 12:31:05,451 INFO L895 garLoopResultBuilder]: At program point L6167(line 6167) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,451 INFO L895 garLoopResultBuilder]: At program point L6646(lines 6645 6647) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,451 INFO L899 garLoopResultBuilder]: For program point L6167-1(line 6167) no Hoare annotation was computed. [2022-07-12 12:31:05,451 INFO L899 garLoopResultBuilder]: For program point L6200(lines 6200 6207) no Hoare annotation was computed. [2022-07-12 12:31:05,451 INFO L895 garLoopResultBuilder]: At program point L6382(lines 6377 6384) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-07-12 12:31:05,451 INFO L899 garLoopResultBuilder]: For program point L6151(lines 6151 6214) no Hoare annotation was computed. [2022-07-12 12:31:05,451 INFO L895 garLoopResultBuilder]: At program point L6118(line 6118) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,452 INFO L899 garLoopResultBuilder]: For program point L6217(lines 6217 6250) no Hoare annotation was computed. [2022-07-12 12:31:05,452 INFO L899 garLoopResultBuilder]: For program point L6118-1(line 6118) no Hoare annotation was computed. [2022-07-12 12:31:05,452 INFO L902 garLoopResultBuilder]: At program point L6300(line 6300) the Hoare annotation is: true [2022-07-12 12:31:05,452 INFO L895 garLoopResultBuilder]: At program point L6664(lines 6663 6665) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,453 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 12:31:05,453 INFO L899 garLoopResultBuilder]: For program point L6202(lines 6202 6205) no Hoare annotation was computed. [2022-07-12 12:31:05,453 INFO L899 garLoopResultBuilder]: For program point L6268(line 6268) no Hoare annotation was computed. [2022-07-12 12:31:05,453 INFO L899 garLoopResultBuilder]: For program point L6136-1(line 6136) no Hoare annotation was computed. [2022-07-12 12:31:05,453 INFO L899 garLoopResultBuilder]: For program point L6582(lines 6582 6585) no Hoare annotation was computed. [2022-07-12 12:31:05,453 INFO L895 garLoopResultBuilder]: At program point L6136(line 6136) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-07-12 12:31:05,453 INFO L899 garLoopResultBuilder]: For program point L6219(lines 6219 6247) no Hoare annotation was computed. [2022-07-12 12:31:05,453 INFO L899 garLoopResultBuilder]: For program point L6252(line 6252) no Hoare annotation was computed. [2022-07-12 12:31:05,453 INFO L899 garLoopResultBuilder]: For program point L6153(lines 6153 6211) no Hoare annotation was computed. [2022-07-12 12:31:05,453 INFO L895 garLoopResultBuilder]: At program point L6120(lines 6114 6122) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,454 INFO L899 garLoopResultBuilder]: For program point L6269(lines 6269 6277) no Hoare annotation was computed. [2022-07-12 12:31:05,454 INFO L895 garLoopResultBuilder]: At program point L6286(line 6286) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,455 INFO L899 garLoopResultBuilder]: For program point L6154(line 6154) no Hoare annotation was computed. [2022-07-12 12:31:05,455 INFO L899 garLoopResultBuilder]: For program point L6253(lines 6253 6304) no Hoare annotation was computed. [2022-07-12 12:31:05,455 INFO L899 garLoopResultBuilder]: For program point L6286-1(line 6286) no Hoare annotation was computed. [2022-07-12 12:31:05,455 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-07-12 12:31:05,456 INFO L895 garLoopResultBuilder]: At program point L5543(lines 5539 5545) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,456 INFO L895 garLoopResultBuilder]: At program point L5857(lines 5841 5859) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,456 INFO L895 garLoopResultBuilder]: At program point L6138(line 6138) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-07-12 12:31:05,456 INFO L902 garLoopResultBuilder]: At program point L6584-1(lines 6577 6588) the Hoare annotation is: true [2022-07-12 12:31:05,456 INFO L899 garLoopResultBuilder]: For program point L6138-1(line 6138) no Hoare annotation was computed. [2022-07-12 12:31:05,456 INFO L895 garLoopResultBuilder]: At program point L6584(line 6584) the Hoare annotation is: false [2022-07-12 12:31:05,456 INFO L899 garLoopResultBuilder]: For program point L6155(lines 6155 6163) no Hoare annotation was computed. [2022-07-12 12:31:05,456 INFO L899 garLoopResultBuilder]: For program point L6221(lines 6221 6226) no Hoare annotation was computed. [2022-07-12 12:31:05,456 INFO L895 garLoopResultBuilder]: At program point L6089(lines 6085 6091) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,456 INFO L895 garLoopResultBuilder]: At program point L6370(lines 6365 6372) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,457 INFO L899 garLoopResultBuilder]: For program point L6271(lines 6271 6275) no Hoare annotation was computed. [2022-07-12 12:31:05,457 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 12:31:05,457 INFO L899 garLoopResultBuilder]: For program point L6255(lines 6255 6301) no Hoare annotation was computed. [2022-07-12 12:31:05,457 INFO L895 garLoopResultBuilder]: At program point L6602(lines 6601 6603) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,457 INFO L899 garLoopResultBuilder]: For program point L6189(line 6189) no Hoare annotation was computed. [2022-07-12 12:31:05,457 INFO L895 garLoopResultBuilder]: At program point L6668(lines 6667 6669) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,457 INFO L895 garLoopResultBuilder]: At program point L6470(lines 6467 6472) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|) (= ~last_index~0 0)) [2022-07-12 12:31:05,457 INFO L895 garLoopResultBuilder]: At program point L6239(lines 6135 6314) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,457 INFO L895 garLoopResultBuilder]: At program point L6107(line 6107) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,458 INFO L899 garLoopResultBuilder]: For program point L6107-1(line 6107) no Hoare annotation was computed. [2022-07-12 12:31:05,458 INFO L895 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,458 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2022-07-12 12:31:05,458 INFO L899 garLoopResultBuilder]: For program point L6190(lines 6190 6197) no Hoare annotation was computed. [2022-07-12 12:31:05,458 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-12 12:31:05,458 INFO L899 garLoopResultBuilder]: For program point L6157(lines 6157 6161) no Hoare annotation was computed. [2022-07-12 12:31:05,458 INFO L895 garLoopResultBuilder]: At program point L6636(lines 6635 6637) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,458 INFO L899 garLoopResultBuilder]: For program point L6306(line 6306) no Hoare annotation was computed. [2022-07-12 12:31:05,459 INFO L895 garLoopResultBuilder]: At program point L6141(line 6141) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-07-12 12:31:05,459 INFO L899 garLoopResultBuilder]: For program point L6141-1(line 6141) no Hoare annotation was computed. [2022-07-12 12:31:05,459 INFO L899 garLoopResultBuilder]: For program point L6257-2(lines 6255 6301) no Hoare annotation was computed. [2022-07-12 12:31:05,459 INFO L899 garLoopResultBuilder]: For program point L6257(lines 6257 6261) no Hoare annotation was computed. [2022-07-12 12:31:05,460 INFO L902 garLoopResultBuilder]: At program point L6307(line 6307) the Hoare annotation is: true [2022-07-12 12:31:05,460 INFO L895 garLoopResultBuilder]: At program point L6142(line 6142) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~last_index~0 0)) [2022-07-12 12:31:05,460 INFO L899 garLoopResultBuilder]: For program point L6142-1(line 6142) no Hoare annotation was computed. [2022-07-12 12:31:05,460 INFO L895 garLoopResultBuilder]: At program point L6109(line 6109) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,460 INFO L899 garLoopResultBuilder]: For program point L6109-1(line 6109) no Hoare annotation was computed. [2022-07-12 12:31:05,460 INFO L899 garLoopResultBuilder]: For program point L6291(line 6291) no Hoare annotation was computed. [2022-07-12 12:31:05,460 INFO L895 garLoopResultBuilder]: At program point L6258(line 6258) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,460 INFO L899 garLoopResultBuilder]: For program point L6258-1(line 6258) no Hoare annotation was computed. [2022-07-12 12:31:05,460 INFO L899 garLoopResultBuilder]: For program point L6192(lines 6192 6195) no Hoare annotation was computed. [2022-07-12 12:31:05,461 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 12:31:05,461 INFO L899 garLoopResultBuilder]: For program point L6209(line 6209) no Hoare annotation was computed. [2022-07-12 12:31:05,461 INFO L899 garLoopResultBuilder]: For program point L6292(lines 6292 6297) no Hoare annotation was computed. [2022-07-12 12:31:05,461 INFO L895 garLoopResultBuilder]: At program point L6606(lines 6605 6607) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,461 INFO L895 garLoopResultBuilder]: At program point L6639(lines 6638 6640) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,461 INFO L902 garLoopResultBuilder]: At program point L6210(line 6210) the Hoare annotation is: true [2022-07-12 12:31:05,461 INFO L895 garLoopResultBuilder]: At program point L6309(lines 6135 6314) the Hoare annotation is: (= ~last_index~0 0) [2022-07-12 12:31:05,461 INFO L895 garLoopResultBuilder]: At program point L6111(lines 6102 6113) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,461 INFO L899 garLoopResultBuilder]: For program point L5848(lines 5848 5854) no Hoare annotation was computed. [2022-07-12 12:31:05,461 INFO L899 garLoopResultBuilder]: For program point L6228(line 6228) no Hoare annotation was computed. [2022-07-12 12:31:05,462 INFO L895 garLoopResultBuilder]: At program point L5799(lines 5794 5801) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,462 INFO L895 garLoopResultBuilder]: At program point L5766(lines 5762 5768) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~last_index~0 0)) [2022-07-12 12:31:05,462 INFO L899 garLoopResultBuilder]: For program point L6179(line 6179) no Hoare annotation was computed. [2022-07-12 12:31:05,462 INFO L899 garLoopResultBuilder]: For program point L6245(line 6245) no Hoare annotation was computed. [2022-07-12 12:31:05,462 INFO L902 garLoopResultBuilder]: At program point L6590(lines 6589 6591) the Hoare annotation is: true [2022-07-12 12:31:05,462 INFO L902 garLoopResultBuilder]: At program point dev_kfree_skb_anyENTRY(lines 5716 5722) the Hoare annotation is: true [2022-07-12 12:31:05,462 INFO L899 garLoopResultBuilder]: For program point dev_kfree_skb_anyEXIT(lines 5716 5722) no Hoare annotation was computed. [2022-07-12 12:31:05,462 INFO L899 garLoopResultBuilder]: For program point dev_kfree_skb_anyFINAL(lines 5716 5722) no Hoare annotation was computed. [2022-07-12 12:31:05,462 INFO L899 garLoopResultBuilder]: For program point L5568(lines 5568 5572) no Hoare annotation was computed. [2022-07-12 12:31:05,463 INFO L899 garLoopResultBuilder]: For program point eem_tx_fixupEXIT(lines 5860 5925) no Hoare annotation was computed. [2022-07-12 12:31:05,463 INFO L895 garLoopResultBuilder]: At program point L5759(lines 5755 5761) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-12 12:31:05,463 INFO L895 garLoopResultBuilder]: At program point L5536(lines 5533 5538) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,463 INFO L899 garLoopResultBuilder]: For program point L5916-1(line 5916) no Hoare annotation was computed. [2022-07-12 12:31:05,463 INFO L895 garLoopResultBuilder]: At program point L5916(line 5916) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-12 12:31:05,463 INFO L899 garLoopResultBuilder]: For program point L5908-1(line 5908) no Hoare annotation was computed. [2022-07-12 12:31:05,463 INFO L895 garLoopResultBuilder]: At program point L5908(line 5908) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~last_index~0 0))) [2022-07-12 12:31:05,463 INFO L895 garLoopResultBuilder]: At program point L5917(line 5917) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-12 12:31:05,463 INFO L899 garLoopResultBuilder]: For program point L5917-1(lines 5875 5924) no Hoare annotation was computed. [2022-07-12 12:31:05,464 INFO L899 garLoopResultBuilder]: For program point L5918(lines 5918 5922) no Hoare annotation was computed. [2022-07-12 12:31:05,464 INFO L899 garLoopResultBuilder]: For program point L5885-2(lines 5885 5902) no Hoare annotation was computed. [2022-07-12 12:31:05,464 INFO L899 garLoopResultBuilder]: For program point L5885(lines 5885 5902) no Hoare annotation was computed. [2022-07-12 12:31:05,464 INFO L902 garLoopResultBuilder]: At program point L5910(lines 5875 5924) the Hoare annotation is: true [2022-07-12 12:31:05,464 INFO L899 garLoopResultBuilder]: For program point L5894(lines 5894 5900) no Hoare annotation was computed. [2022-07-12 12:31:05,464 INFO L895 garLoopResultBuilder]: At program point L5919(line 5919) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-12 12:31:05,464 INFO L899 garLoopResultBuilder]: For program point L5919-1(line 5919) no Hoare annotation was computed. [2022-07-12 12:31:05,464 INFO L902 garLoopResultBuilder]: At program point L5597(lines 5592 5599) the Hoare annotation is: true [2022-07-12 12:31:05,464 INFO L902 garLoopResultBuilder]: At program point L5911(line 5911) the Hoare annotation is: true [2022-07-12 12:31:05,464 INFO L899 garLoopResultBuilder]: For program point L5911-1(line 5911) no Hoare annotation was computed. [2022-07-12 12:31:05,465 INFO L902 garLoopResultBuilder]: At program point L5589(lines 5585 5591) the Hoare annotation is: true [2022-07-12 12:31:05,465 INFO L895 garLoopResultBuilder]: At program point L5556(lines 5553 5558) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,465 INFO L899 garLoopResultBuilder]: For program point L5614(line 5614) no Hoare annotation was computed. [2022-07-12 12:31:05,465 INFO L895 garLoopResultBuilder]: At program point L5614-3(lines 5609 5616) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,465 INFO L899 garLoopResultBuilder]: For program point L5614-2(line 5614) no Hoare annotation was computed. [2022-07-12 12:31:05,465 INFO L895 garLoopResultBuilder]: At program point L5606(lines 5603 5608) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,465 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-12 12:31:05,465 INFO L895 garLoopResultBuilder]: At program point L5920(line 5920) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-12 12:31:05,465 INFO L899 garLoopResultBuilder]: For program point eem_tx_fixupFINAL(lines 5860 5925) no Hoare annotation was computed. [2022-07-12 12:31:05,466 INFO L902 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: true [2022-07-12 12:31:05,466 INFO L899 garLoopResultBuilder]: For program point L5565(lines 5565 5575) no Hoare annotation was computed. [2022-07-12 12:31:05,466 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-07-12 12:31:05,466 INFO L899 garLoopResultBuilder]: For program point L5565-1(lines 5565 5575) no Hoare annotation was computed. [2022-07-12 12:31:05,466 INFO L895 garLoopResultBuilder]: At program point L5912-2(line 5912) the Hoare annotation is: (not (= ~last_index~0 0)) [2022-07-12 12:31:05,466 INFO L895 garLoopResultBuilder]: At program point eem_tx_fixupENTRY(lines 5860 5925) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,466 INFO L899 garLoopResultBuilder]: For program point L5912(line 5912) no Hoare annotation was computed. [2022-07-12 12:31:05,466 INFO L895 garLoopResultBuilder]: At program point L5582(lines 5579 5584) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,466 INFO L899 garLoopResultBuilder]: For program point L5904(lines 5904 5907) no Hoare annotation was computed. [2022-07-12 12:31:05,467 INFO L899 garLoopResultBuilder]: For program point L5880-2(lines 5880 5883) no Hoare annotation was computed. [2022-07-12 12:31:05,467 INFO L899 garLoopResultBuilder]: For program point L5913(line 5913) no Hoare annotation was computed. [2022-07-12 12:31:05,467 INFO L899 garLoopResultBuilder]: For program point L5880(lines 5880 5883) no Hoare annotation was computed. [2022-07-12 12:31:05,467 INFO L895 garLoopResultBuilder]: At program point L6616-2(lines 6615 6617) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~last_index~0 0))) [2022-07-12 12:31:05,467 INFO L899 garLoopResultBuilder]: For program point L6616-1(line 6616) no Hoare annotation was computed. [2022-07-12 12:31:05,467 INFO L895 garLoopResultBuilder]: At program point L6616(line 6616) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,467 INFO L895 garLoopResultBuilder]: At program point L5576(lines 5559 5578) the Hoare annotation is: (or (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-07-12 12:31:05,468 INFO L899 garLoopResultBuilder]: For program point L5890(lines 5890 5893) no Hoare annotation was computed. [2022-07-12 12:31:05,470 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-12 12:31:05,471 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 12:31:05,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 12:31:05 BoogieIcfgContainer [2022-07-12 12:31:05,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 12:31:05,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 12:31:05,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 12:31:05,522 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 12:31:05,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:30:47" (3/4) ... [2022-07-12 12:31:05,525 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure put_unaligned_le16 [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_push [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_set_remove [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_clone [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free [2022-07-12 12:31:05,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_put [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eem_rx_fixup [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure crc32_le [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_pull [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure skb_trim [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_kfree_skb_any [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eem_tx_fixup [2022-07-12 12:31:05,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2022-07-12 12:31:05,551 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 141 nodes and edges [2022-07-12 12:31:05,553 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-07-12 12:31:05,554 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-12 12:31:05,555 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 12:31:05,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 12:31:05,579 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,580 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(last_index == 0) [2022-07-12 12:31:05,582 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1 <= \result && last_index == 0 [2022-07-12 12:31:05,582 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == deleted_index + 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 <= i) && \old(last_index) == last_index) [2022-07-12 12:31:05,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) [2022-07-12 12:31:05,586 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,586 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,586 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) [2022-07-12 12:31:05,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,588 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) [2022-07-12 12:31:05,588 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(last_index) == 0) || \old(last_index) == last_index [2022-07-12 12:31:05,588 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) [2022-07-12 12:31:05,588 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) [2022-07-12 12:31:05,588 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) [2022-07-12 12:31:05,589 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) [2022-07-12 12:31:05,650 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 12:31:05,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 12:31:05,651 INFO L158 Benchmark]: Toolchain (without parser) took 21375.80ms. Allocated memory was 115.3MB in the beginning and 314.6MB in the end (delta: 199.2MB). Free memory was 74.3MB in the beginning and 98.8MB in the end (delta: -24.5MB). Peak memory consumption was 176.1MB. Max. memory is 16.1GB. [2022-07-12 12:31:05,651 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 12:31:05,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1087.99ms. Allocated memory was 115.3MB in the beginning and 146.8MB in the end (delta: 31.5MB). Free memory was 74.0MB in the beginning and 94.7MB in the end (delta: -20.6MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2022-07-12 12:31:05,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.06ms. Allocated memory is still 146.8MB. Free memory was 94.7MB in the beginning and 87.7MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 12:31:05,652 INFO L158 Benchmark]: Boogie Preprocessor took 82.87ms. Allocated memory is still 146.8MB. Free memory was 87.7MB in the beginning and 80.0MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 12:31:05,652 INFO L158 Benchmark]: RCFGBuilder took 1466.77ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 80.0MB in the beginning and 99.6MB in the end (delta: -19.5MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2022-07-12 12:31:05,652 INFO L158 Benchmark]: TraceAbstraction took 18496.59ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 99.6MB in the beginning and 118.0MB in the end (delta: -18.4MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2022-07-12 12:31:05,653 INFO L158 Benchmark]: Witness Printer took 128.75ms. Allocated memory is still 314.6MB. Free memory was 118.0MB in the beginning and 98.8MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 12:31:05,654 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.16ms. Allocated memory is still 81.8MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1087.99ms. Allocated memory was 115.3MB in the beginning and 146.8MB in the end (delta: 31.5MB). Free memory was 74.0MB in the beginning and 94.7MB in the end (delta: -20.6MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.06ms. Allocated memory is still 146.8MB. Free memory was 94.7MB in the beginning and 87.7MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.87ms. Allocated memory is still 146.8MB. Free memory was 87.7MB in the beginning and 80.0MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1466.77ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 80.0MB in the beginning and 99.6MB in the end (delta: -19.5MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18496.59ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 99.6MB in the beginning and 118.0MB in the end (delta: -18.4MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. * Witness Printer took 128.75ms. Allocated memory is still 314.6MB. Free memory was 118.0MB in the beginning and 98.8MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 5681]: 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 22 procedures, 332 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4859 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4682 mSDsluCounter, 8612 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6251 mSDsCounter, 1567 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3980 IncrementalHoareTripleChecker+Invalid, 5547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1567 mSolverCounterUnsat, 2361 mSDtfsCounter, 3980 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2564occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 1765 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 130 LocationsWithAnnotation, 3362 PreInvPairs, 4034 NumberOfFragments, 1017 HoareAnnotationTreeSize, 3362 FomulaSimplifications, 45204 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 130 FomulaSimplificationsInter, 47346 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 1891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 388/388 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 1 specifications checked. All of them hold - InvariantResult [Line: 5559]: Loop Invariant [2022-07-12 12:31:05,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) - InvariantResult [Line: 6102]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 6663]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 6123]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5486]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5732]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6632]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6601]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 6365]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5952]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6615]: Loop Invariant [2022-07-12 12:31:05,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(last_index == 0) - InvariantResult [Line: 6638]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5775]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5521]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5509]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6377]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 0 && last_index == 0 - InvariantResult [Line: 6659]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5724]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6135]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 6645]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && last_index == 0 - InvariantResult [Line: 5755]: Loop Invariant Derived loop invariant: !(last_index == 0) - InvariantResult [Line: 6467]: Loop Invariant Derived loop invariant: 1 <= \result && last_index == 0 - InvariantResult [Line: 6135]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6351]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && last_index == 0 - InvariantResult [Line: 5539]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5501]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5762]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5609]: Loop Invariant [2022-07-12 12:31:05,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) - InvariantResult [Line: 6114]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && last_index == 0 - InvariantResult [Line: 5493]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5515]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6652]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5740]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5821]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6589]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6077]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && last_index == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6432]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) - InvariantResult [Line: 5603]: Loop Invariant [2022-07-12 12:31:05,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) - InvariantResult [Line: 6418]: Loop Invariant [2022-07-12 12:31:05,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(\old(last_index) == 0) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == deleted_index + 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 <= i) && \old(last_index) == last_index) - InvariantResult [Line: 6605]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5841]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 5684]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6667]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5942]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5875]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6635]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5553]: Loop Invariant [2022-07-12 12:31:05,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) - InvariantResult [Line: 6670]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5533]: Loop Invariant [2022-07-12 12:31:05,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) - InvariantResult [Line: 6085]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 1 && last_index == 0 - InvariantResult [Line: 6674]: Loop Invariant Derived loop invariant: last_index == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6525]: Loop Invariant Derived loop invariant: ldv_state_variable_2 == 0 && last_index == 0 - InvariantResult [Line: 5585]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5942]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 6649]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5817]: Loop Invariant Derived loop invariant: !(\old(last_index) == 0) || \old(last_index) == last_index - InvariantResult [Line: 5579]: Loop Invariant [2022-07-12 12:31:05,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 12:31:05,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 12:31:05,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: !(last_index == 0) || ((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) RESULT: Ultimate proved your program to be correct! [2022-07-12 12:31:05,743 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