./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.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 e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 22:42:22,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 22:42:22,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 22:42:23,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 22:42:23,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 22:42:23,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 22:42:23,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 22:42:23,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 22:42:23,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 22:42:23,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 22:42:23,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 22:42:23,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 22:42:23,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 22:42:23,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 22:42:23,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 22:42:23,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 22:42:23,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 22:42:23,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 22:42:23,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 22:42:23,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 22:42:23,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 22:42:23,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 22:42:23,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 22:42:23,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 22:42:23,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 22:42:23,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 22:42:23,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 22:42:23,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 22:42:23,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 22:42:23,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 22:42:23,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 22:42:23,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 22:42:23,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 22:42:23,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 22:42:23,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 22:42:23,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 22:42:23,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 22:42:23,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 22:42:23,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 22:42:23,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 22:42:23,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 22:42:23,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 22:42:23,076 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 22:42:23,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 22:42:23,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 22:42:23,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 22:42:23,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 22:42:23,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 22:42:23,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 22:42:23,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 22:42:23,079 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 22:42:23,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 22:42:23,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 22:42:23,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 22:42:23,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 22:42:23,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 22:42:23,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 22:42:23,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 22:42:23,081 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 22:42:23,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 22:42:23,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 22:42:23,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 22:42:23,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 22:42:23,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 22:42:23,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 22:42:23,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 22:42:23,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 22:42:23,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 22:42:23,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 22:42:23,083 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 22:42:23,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 22:42:23,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 22:42:23,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 22:42:23,084 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 -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 [2021-11-16 22:42:23,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 22:42:23,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 22:42:23,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 22:42:23,274 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 22:42:23,275 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 22:42:23,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-11-16 22:42:23,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4977ec274/9cd73ad67d6f4613bbec1d5c62671b5c/FLAG26a63141b [2021-11-16 22:42:23,886 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 22:42:23,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-11-16 22:42:23,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4977ec274/9cd73ad67d6f4613bbec1d5c62671b5c/FLAG26a63141b [2021-11-16 22:42:24,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4977ec274/9cd73ad67d6f4613bbec1d5c62671b5c [2021-11-16 22:42:24,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 22:42:24,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 22:42:24,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 22:42:24,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 22:42:24,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 22:42:24,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:24,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c978cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24, skipping insertion in model container [2021-11-16 22:42:24,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:24,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 22:42:24,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 22:42:24,716 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-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2021-11-16 22:42:24,736 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 22:42:24,747 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 22:42:24,855 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-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2021-11-16 22:42:24,859 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 22:42:24,882 INFO L208 MainTranslator]: Completed translation [2021-11-16 22:42:24,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24 WrapperNode [2021-11-16 22:42:24,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 22:42:24,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 22:42:24,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 22:42:24,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 22:42:24,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:24,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:24,981 INFO L137 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 48, calls inlined = 43, statements flattened = 1093 [2021-11-16 22:42:24,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 22:42:24,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 22:42:24,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 22:42:24,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 22:42:24,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:24,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:25,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:25,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:25,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:25,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:25,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:25,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 22:42:25,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 22:42:25,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 22:42:25,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 22:42:25,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (1/1) ... [2021-11-16 22:42:25,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 22:42:25,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:42:25,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 22:42:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-16 22:42:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-16 22:42:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 22:42:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 22:42:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-16 22:42:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-16 22:42:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-16 22:42:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-16 22:42:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 22:42:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-16 22:42:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-16 22:42:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2021-11-16 22:42:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2021-11-16 22:42:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 22:42:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 22:42:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2021-11-16 22:42:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2021-11-16 22:42:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 22:42:25,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 22:42:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2021-11-16 22:42:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2021-11-16 22:42:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 22:42:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-16 22:42:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2021-11-16 22:42:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-16 22:42:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2021-11-16 22:42:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-11-16 22:42:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-11-16 22:42:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2021-11-16 22:42:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-16 22:42:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-16 22:42:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-16 22:42:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-16 22:42:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 22:42:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2021-11-16 22:42:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2021-11-16 22:42:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2021-11-16 22:42:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2021-11-16 22:42:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-16 22:42:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2021-11-16 22:42:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2021-11-16 22:42:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 22:42:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 22:42:25,405 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 22:42:25,407 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 22:42:26,201 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 22:42:26,209 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 22:42:26,211 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 22:42:26,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:42:26 BoogieIcfgContainer [2021-11-16 22:42:26,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 22:42:26,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 22:42:26,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 22:42:26,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 22:42:26,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:42:24" (1/3) ... [2021-11-16 22:42:26,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706f8658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:42:26, skipping insertion in model container [2021-11-16 22:42:26,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:42:24" (2/3) ... [2021-11-16 22:42:26,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706f8658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:42:26, skipping insertion in model container [2021-11-16 22:42:26,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:42:26" (3/3) ... [2021-11-16 22:42:26,221 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2021-11-16 22:42:26,225 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 22:42:26,225 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 22:42:26,268 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 22:42:26,273 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 22:42:26,274 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 22:42:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 214 states have internal predecessors, (271), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2021-11-16 22:42:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-16 22:42:26,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:26,319 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 22:42:26,319 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:26,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1527877958, now seen corresponding path program 1 times [2021-11-16 22:42:26,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:26,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302136918] [2021-11-16 22:42:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:26,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 22:42:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 22:42:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 22:42:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 22:42:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 22:42:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 22:42:26,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:26,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302136918] [2021-11-16 22:42:26,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302136918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:26,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:26,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:42:26,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906470161] [2021-11-16 22:42:26,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:26,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:42:26,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:26,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:42:26,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:26,869 INFO L87 Difference]: Start difference. First operand has 275 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 214 states have internal predecessors, (271), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-16 22:42:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:27,715 INFO L93 Difference]: Finished difference Result 678 states and 930 transitions. [2021-11-16 22:42:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 22:42:27,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2021-11-16 22:42:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:27,732 INFO L225 Difference]: With dead ends: 678 [2021-11-16 22:42:27,732 INFO L226 Difference]: Without dead ends: 375 [2021-11-16 22:42:27,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:42:27,738 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 325 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:27,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 1476 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 22:42:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-16 22:42:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 263. [2021-11-16 22:42:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 201 states have (on average 1.2835820895522387) internal successors, (258), 204 states have internal predecessors, (258), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-11-16 22:42:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 346 transitions. [2021-11-16 22:42:27,785 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 346 transitions. Word has length 122 [2021-11-16 22:42:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:27,786 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 346 transitions. [2021-11-16 22:42:27,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-16 22:42:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 346 transitions. [2021-11-16 22:42:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 22:42:27,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:27,788 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 22:42:27,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 22:42:27,788 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1747602214, now seen corresponding path program 1 times [2021-11-16 22:42:27,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:27,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079017290] [2021-11-16 22:42:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:27,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 22:42:27,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:27,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079017290] [2021-11-16 22:42:27,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079017290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:27,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:27,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:42:27,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94994301] [2021-11-16 22:42:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:27,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:42:27,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:27,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:42:27,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:42:27,970 INFO L87 Difference]: Start difference. First operand 263 states and 346 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 22:42:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:28,477 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2021-11-16 22:42:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 22:42:28,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-11-16 22:42:28,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:28,481 INFO L225 Difference]: With dead ends: 548 [2021-11-16 22:42:28,481 INFO L226 Difference]: Without dead ends: 293 [2021-11-16 22:42:28,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:28,484 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 155 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:28,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 874 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-16 22:42:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-16 22:42:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 264. [2021-11-16 22:42:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.2821782178217822) internal successors, (259), 205 states have internal predecessors, (259), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-11-16 22:42:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 347 transitions. [2021-11-16 22:42:28,497 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 347 transitions. Word has length 130 [2021-11-16 22:42:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:28,498 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 347 transitions. [2021-11-16 22:42:28,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 22:42:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 347 transitions. [2021-11-16 22:42:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 22:42:28,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:28,499 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 22:42:28,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 22:42:28,499 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash -329734684, now seen corresponding path program 1 times [2021-11-16 22:42:28,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:28,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922061237] [2021-11-16 22:42:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:28,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 22:42:28,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:28,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922061237] [2021-11-16 22:42:28,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922061237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:28,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:28,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:42:28,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308290880] [2021-11-16 22:42:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:28,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:42:28,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:42:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:28,664 INFO L87 Difference]: Start difference. First operand 264 states and 347 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 22:42:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:29,271 INFO L93 Difference]: Finished difference Result 627 states and 845 transitions. [2021-11-16 22:42:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 22:42:29,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-11-16 22:42:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:29,274 INFO L225 Difference]: With dead ends: 627 [2021-11-16 22:42:29,274 INFO L226 Difference]: Without dead ends: 371 [2021-11-16 22:42:29,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:42:29,276 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 308 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:29,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 1366 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 22:42:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-11-16 22:42:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 266. [2021-11-16 22:42:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 204 states have (on average 1.2794117647058822) internal successors, (261), 207 states have internal predecessors, (261), 45 states have call successors, (45), 17 states have call predecessors, (45), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-11-16 22:42:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2021-11-16 22:42:29,296 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 130 [2021-11-16 22:42:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:29,296 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2021-11-16 22:42:29,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 22:42:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2021-11-16 22:42:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 22:42:29,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:29,297 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 22:42:29,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 22:42:29,298 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:29,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1056468710, now seen corresponding path program 1 times [2021-11-16 22:42:29,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:29,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077904635] [2021-11-16 22:42:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:29,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 22:42:29,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:29,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077904635] [2021-11-16 22:42:29,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077904635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:29,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:29,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 22:42:29,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834618015] [2021-11-16 22:42:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:29,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 22:42:29,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:29,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 22:42:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:42:29,554 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 22:42:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:30,758 INFO L93 Difference]: Finished difference Result 863 states and 1155 transitions. [2021-11-16 22:42:30,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-16 22:42:30,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-11-16 22:42:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:30,763 INFO L225 Difference]: With dead ends: 863 [2021-11-16 22:42:30,763 INFO L226 Difference]: Without dead ends: 859 [2021-11-16 22:42:30,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-16 22:42:30,765 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 1105 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:30,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1166 Valid, 1420 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 22:42:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-11-16 22:42:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 772. [2021-11-16 22:42:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 594 states have (on average 1.2811447811447811) internal successors, (761), 601 states have internal predecessors, (761), 129 states have call successors, (129), 49 states have call predecessors, (129), 48 states have return successors, (131), 127 states have call predecessors, (131), 127 states have call successors, (131) [2021-11-16 22:42:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1021 transitions. [2021-11-16 22:42:30,800 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1021 transitions. Word has length 130 [2021-11-16 22:42:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:30,801 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 1021 transitions. [2021-11-16 22:42:30,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 22:42:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1021 transitions. [2021-11-16 22:42:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-16 22:42:30,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:30,803 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 22:42:30,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 22:42:30,803 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash 88761714, now seen corresponding path program 1 times [2021-11-16 22:42:30,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:30,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106383530] [2021-11-16 22:42:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:30,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-16 22:42:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 22:42:30,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:30,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106383530] [2021-11-16 22:42:30,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106383530] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:42:30,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045476348] [2021-11-16 22:42:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:30,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:42:30,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:42:30,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 22:42:30,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 22:42:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 22:42:31,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:42:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 22:42:31,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 22:42:31,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045476348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:31,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 22:42:31,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-16 22:42:31,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967830493] [2021-11-16 22:42:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:31,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 22:42:31,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 22:42:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:42:31,500 INFO L87 Difference]: Start difference. First operand 772 states and 1021 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 22:42:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:31,563 INFO L93 Difference]: Finished difference Result 1538 states and 2037 transitions. [2021-11-16 22:42:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 22:42:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 140 [2021-11-16 22:42:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:31,569 INFO L225 Difference]: With dead ends: 1538 [2021-11-16 22:42:31,569 INFO L226 Difference]: Without dead ends: 1280 [2021-11-16 22:42:31,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:42:31,571 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 326 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:31,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 990 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 22:42:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2021-11-16 22:42:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1025. [2021-11-16 22:42:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 789 states have (on average 1.2801013941698351) internal successors, (1010), 798 states have internal predecessors, (1010), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-11-16 22:42:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1354 transitions. [2021-11-16 22:42:31,612 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1354 transitions. Word has length 140 [2021-11-16 22:42:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:31,613 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1354 transitions. [2021-11-16 22:42:31,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 22:42:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1354 transitions. [2021-11-16 22:42:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-16 22:42:31,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:31,615 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:31,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 22:42:31,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:42:31,832 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1821132084, now seen corresponding path program 1 times [2021-11-16 22:42:31,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:31,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777194788] [2021-11-16 22:42:31,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:31,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-16 22:42:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-16 22:42:32,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:32,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777194788] [2021-11-16 22:42:32,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777194788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:32,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:32,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:42:32,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983272239] [2021-11-16 22:42:32,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:32,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:42:32,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:32,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:42:32,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:32,002 INFO L87 Difference]: Start difference. First operand 1025 states and 1354 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:32,707 INFO L93 Difference]: Finished difference Result 2698 states and 3689 transitions. [2021-11-16 22:42:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 22:42:32,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-11-16 22:42:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:32,715 INFO L225 Difference]: With dead ends: 2698 [2021-11-16 22:42:32,715 INFO L226 Difference]: Without dead ends: 1681 [2021-11-16 22:42:32,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:42:32,718 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 291 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:32,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 1692 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 22:42:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2021-11-16 22:42:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1033. [2021-11-16 22:42:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 797 states have (on average 1.2772898368883312) internal successors, (1018), 806 states have internal predecessors, (1018), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-11-16 22:42:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1362 transitions. [2021-11-16 22:42:32,795 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1362 transitions. Word has length 184 [2021-11-16 22:42:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:32,796 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1362 transitions. [2021-11-16 22:42:32,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1362 transitions. [2021-11-16 22:42:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-16 22:42:32,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:32,799 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:32,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 22:42:32,799 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:32,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1580348874, now seen corresponding path program 1 times [2021-11-16 22:42:32,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:32,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327378392] [2021-11-16 22:42:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:32,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-16 22:42:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-16 22:42:32,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:32,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327378392] [2021-11-16 22:42:32,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327378392] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:32,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:32,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:42:32,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762241377] [2021-11-16 22:42:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:32,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:42:32,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:32,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:42:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:42:32,962 INFO L87 Difference]: Start difference. First operand 1033 states and 1362 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:33,441 INFO L93 Difference]: Finished difference Result 2178 states and 2895 transitions. [2021-11-16 22:42:33,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 22:42:33,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-11-16 22:42:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:33,447 INFO L225 Difference]: With dead ends: 2178 [2021-11-16 22:42:33,447 INFO L226 Difference]: Without dead ends: 1153 [2021-11-16 22:42:33,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:33,450 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 155 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:33,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 877 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 22:42:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-11-16 22:42:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1037. [2021-11-16 22:42:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 801 states have (on average 1.2759051186017478) internal successors, (1022), 810 states have internal predecessors, (1022), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-11-16 22:42:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1366 transitions. [2021-11-16 22:42:33,518 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1366 transitions. Word has length 184 [2021-11-16 22:42:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:33,519 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1366 transitions. [2021-11-16 22:42:33,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1366 transitions. [2021-11-16 22:42:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-16 22:42:33,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:33,523 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:33,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 22:42:33,524 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash 347923828, now seen corresponding path program 1 times [2021-11-16 22:42:33,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:33,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058565873] [2021-11-16 22:42:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:33,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-16 22:42:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-16 22:42:33,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:33,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058565873] [2021-11-16 22:42:33,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058565873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:33,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:33,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:42:33,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852492060] [2021-11-16 22:42:33,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:33,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:42:33,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:33,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:42:33,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:33,659 INFO L87 Difference]: Start difference. First operand 1037 states and 1366 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:34,474 INFO L93 Difference]: Finished difference Result 3838 states and 5391 transitions. [2021-11-16 22:42:34,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 22:42:34,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 184 [2021-11-16 22:42:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:34,484 INFO L225 Difference]: With dead ends: 3838 [2021-11-16 22:42:34,484 INFO L226 Difference]: Without dead ends: 2809 [2021-11-16 22:42:34,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:42:34,488 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 636 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:34,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 2245 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 22:42:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2021-11-16 22:42:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 1045. [2021-11-16 22:42:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 809 states have (on average 1.273176761433869) internal successors, (1030), 818 states have internal predecessors, (1030), 171 states have call successors, (171), 65 states have call predecessors, (171), 64 states have return successors, (173), 169 states have call predecessors, (173), 169 states have call successors, (173) [2021-11-16 22:42:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1374 transitions. [2021-11-16 22:42:34,552 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1374 transitions. Word has length 184 [2021-11-16 22:42:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:34,553 INFO L470 AbstractCegarLoop]: Abstraction has 1045 states and 1374 transitions. [2021-11-16 22:42:34,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1374 transitions. [2021-11-16 22:42:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-11-16 22:42:34,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:34,555 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:34,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 22:42:34,556 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash 830531558, now seen corresponding path program 1 times [2021-11-16 22:42:34,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:34,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703193305] [2021-11-16 22:42:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:34,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-16 22:42:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-16 22:42:34,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:34,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703193305] [2021-11-16 22:42:34,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703193305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:34,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:34,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:42:34,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587286579] [2021-11-16 22:42:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:34,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:42:34,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:34,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:42:34,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:34,710 INFO L87 Difference]: Start difference. First operand 1045 states and 1374 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:35,605 INFO L93 Difference]: Finished difference Result 3946 states and 5543 transitions. [2021-11-16 22:42:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 22:42:35,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 185 [2021-11-16 22:42:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:35,617 INFO L225 Difference]: With dead ends: 3946 [2021-11-16 22:42:35,617 INFO L226 Difference]: Without dead ends: 2909 [2021-11-16 22:42:35,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:42:35,621 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 737 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:35,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 2125 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 22:42:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2021-11-16 22:42:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1124. [2021-11-16 22:42:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 880 states have (on average 1.2761363636363636) internal successors, (1123), 889 states have internal predecessors, (1123), 179 states have call successors, (179), 65 states have call predecessors, (179), 64 states have return successors, (181), 177 states have call predecessors, (181), 177 states have call successors, (181) [2021-11-16 22:42:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1483 transitions. [2021-11-16 22:42:35,697 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1483 transitions. Word has length 185 [2021-11-16 22:42:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:35,697 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 1483 transitions. [2021-11-16 22:42:35,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1483 transitions. [2021-11-16 22:42:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-11-16 22:42:35,700 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:35,700 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:35,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-16 22:42:35,700 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1883377874, now seen corresponding path program 1 times [2021-11-16 22:42:35,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:35,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583301824] [2021-11-16 22:42:35,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:35,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-16 22:42:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-16 22:42:35,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:35,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583301824] [2021-11-16 22:42:35,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583301824] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:35,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:35,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:42:35,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143857361] [2021-11-16 22:42:35,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:35,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:42:35,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:35,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:42:35,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:35,821 INFO L87 Difference]: Start difference. First operand 1124 states and 1483 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:36,746 INFO L93 Difference]: Finished difference Result 4208 states and 5903 transitions. [2021-11-16 22:42:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 22:42:36,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 185 [2021-11-16 22:42:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:36,758 INFO L225 Difference]: With dead ends: 4208 [2021-11-16 22:42:36,758 INFO L226 Difference]: Without dead ends: 3092 [2021-11-16 22:42:36,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:42:36,761 INFO L933 BasicCegarLoop]: 710 mSDtfsCounter, 686 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:36,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [762 Valid, 2443 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 22:42:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2021-11-16 22:42:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1132. [2021-11-16 22:42:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 888 states have (on average 1.2736486486486487) internal successors, (1131), 897 states have internal predecessors, (1131), 179 states have call successors, (179), 65 states have call predecessors, (179), 64 states have return successors, (181), 177 states have call predecessors, (181), 177 states have call successors, (181) [2021-11-16 22:42:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1491 transitions. [2021-11-16 22:42:36,839 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1491 transitions. Word has length 185 [2021-11-16 22:42:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:36,840 INFO L470 AbstractCegarLoop]: Abstraction has 1132 states and 1491 transitions. [2021-11-16 22:42:36,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:42:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1491 transitions. [2021-11-16 22:42:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-16 22:42:36,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:36,843 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:36,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-16 22:42:36,843 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -124338905, now seen corresponding path program 1 times [2021-11-16 22:42:36,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:36,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609335718] [2021-11-16 22:42:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:36,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-16 22:42:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-16 22:42:36,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:36,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609335718] [2021-11-16 22:42:36,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609335718] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:42:36,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467679964] [2021-11-16 22:42:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:36,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:42:36,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:42:36,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 22:42:36,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 22:42:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:37,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 22:42:37,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:42:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-16 22:42:37,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:42:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-16 22:42:37,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467679964] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 22:42:37,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 22:42:37,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2021-11-16 22:42:37,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42426591] [2021-11-16 22:42:37,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 22:42:37,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 22:42:37,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:37,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 22:42:37,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:42:37,823 INFO L87 Difference]: Start difference. First operand 1132 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-16 22:42:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:38,734 INFO L93 Difference]: Finished difference Result 3782 states and 5259 transitions. [2021-11-16 22:42:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 22:42:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 186 [2021-11-16 22:42:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:38,743 INFO L225 Difference]: With dead ends: 3782 [2021-11-16 22:42:38,743 INFO L226 Difference]: Without dead ends: 2658 [2021-11-16 22:42:38,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-16 22:42:38,746 INFO L933 BasicCegarLoop]: 501 mSDtfsCounter, 666 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:38,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 1661 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 22:42:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-11-16 22:42:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1508. [2021-11-16 22:42:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1216 states have (on average 1.278782894736842) internal successors, (1555), 1225 states have internal predecessors, (1555), 227 states have call successors, (227), 65 states have call predecessors, (227), 64 states have return successors, (229), 225 states have call predecessors, (229), 225 states have call successors, (229) [2021-11-16 22:42:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2011 transitions. [2021-11-16 22:42:38,817 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2011 transitions. Word has length 186 [2021-11-16 22:42:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:38,818 INFO L470 AbstractCegarLoop]: Abstraction has 1508 states and 2011 transitions. [2021-11-16 22:42:38,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 6 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-16 22:42:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2011 transitions. [2021-11-16 22:42:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-11-16 22:42:38,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:38,821 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 22:42:38,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-16 22:42:39,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-16 22:42:39,041 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1741248058, now seen corresponding path program 1 times [2021-11-16 22:42:39,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:39,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540532927] [2021-11-16 22:42:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:39,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-16 22:42:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-16 22:42:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-11-16 22:42:39,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:39,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540532927] [2021-11-16 22:42:39,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540532927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:39,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:39,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:42:39,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649339098] [2021-11-16 22:42:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:39,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:42:39,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:42:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:42:39,192 INFO L87 Difference]: Start difference. First operand 1508 states and 2011 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-16 22:42:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:40,124 INFO L93 Difference]: Finished difference Result 2373 states and 3203 transitions. [2021-11-16 22:42:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 22:42:40,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 198 [2021-11-16 22:42:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:40,129 INFO L225 Difference]: With dead ends: 2373 [2021-11-16 22:42:40,130 INFO L226 Difference]: Without dead ends: 1220 [2021-11-16 22:42:40,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-16 22:42:40,132 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 439 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:40,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 1465 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 22:42:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2021-11-16 22:42:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1128. [2021-11-16 22:42:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 908 states have (on average 1.263215859030837) internal successors, (1147), 915 states have internal predecessors, (1147), 171 states have call successors, (171), 49 states have call predecessors, (171), 48 states have return successors, (171), 169 states have call predecessors, (171), 169 states have call successors, (171) [2021-11-16 22:42:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1489 transitions. [2021-11-16 22:42:40,172 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1489 transitions. Word has length 198 [2021-11-16 22:42:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:40,172 INFO L470 AbstractCegarLoop]: Abstraction has 1128 states and 1489 transitions. [2021-11-16 22:42:40,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-16 22:42:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1489 transitions. [2021-11-16 22:42:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-11-16 22:42:40,175 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:40,175 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:40,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-16 22:42:40,176 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash -829148697, now seen corresponding path program 1 times [2021-11-16 22:42:40,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:40,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966266339] [2021-11-16 22:42:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:40,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-16 22:42:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-16 22:42:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-16 22:42:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-11-16 22:42:40,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:40,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966266339] [2021-11-16 22:42:40,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966266339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:40,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:40,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:42:40,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496822283] [2021-11-16 22:42:40,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:40,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:42:40,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:42:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:42:40,319 INFO L87 Difference]: Start difference. First operand 1128 states and 1489 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-16 22:42:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:41,130 INFO L93 Difference]: Finished difference Result 3214 states and 4411 transitions. [2021-11-16 22:42:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 22:42:41,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 220 [2021-11-16 22:42:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:41,143 INFO L225 Difference]: With dead ends: 3214 [2021-11-16 22:42:41,143 INFO L226 Difference]: Without dead ends: 2094 [2021-11-16 22:42:41,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:42:41,146 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 491 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:41,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 1821 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 22:42:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2021-11-16 22:42:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1134. [2021-11-16 22:42:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 914 states have (on average 1.2614879649890591) internal successors, (1153), 921 states have internal predecessors, (1153), 171 states have call successors, (171), 49 states have call predecessors, (171), 48 states have return successors, (171), 169 states have call predecessors, (171), 169 states have call successors, (171) [2021-11-16 22:42:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1495 transitions. [2021-11-16 22:42:41,202 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1495 transitions. Word has length 220 [2021-11-16 22:42:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:41,202 INFO L470 AbstractCegarLoop]: Abstraction has 1134 states and 1495 transitions. [2021-11-16 22:42:41,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-16 22:42:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1495 transitions. [2021-11-16 22:42:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-11-16 22:42:41,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:41,206 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:41,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-16 22:42:41,206 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1357206825, now seen corresponding path program 1 times [2021-11-16 22:42:41,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:41,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820190255] [2021-11-16 22:42:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:41,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-16 22:42:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-16 22:42:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-11-16 22:42:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2021-11-16 22:42:41,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:41,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820190255] [2021-11-16 22:42:41,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820190255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:41,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:41,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:42:41,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586762736] [2021-11-16 22:42:41,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:41,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:42:41,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:41,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:42:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:42:41,389 INFO L87 Difference]: Start difference. First operand 1134 states and 1495 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-16 22:42:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:42,081 INFO L93 Difference]: Finished difference Result 2163 states and 2861 transitions. [2021-11-16 22:42:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 22:42:42,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 236 [2021-11-16 22:42:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:42,087 INFO L225 Difference]: With dead ends: 2163 [2021-11-16 22:42:42,087 INFO L226 Difference]: Without dead ends: 1037 [2021-11-16 22:42:42,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-16 22:42:42,089 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 529 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:42,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 907 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 22:42:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-11-16 22:42:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 947. [2021-11-16 22:42:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 747 states have (on average 1.2449799196787148) internal successors, (930), 754 states have internal predecessors, (930), 151 states have call successors, (151), 49 states have call predecessors, (151), 48 states have return successors, (151), 149 states have call predecessors, (151), 149 states have call successors, (151) [2021-11-16 22:42:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1232 transitions. [2021-11-16 22:42:42,130 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1232 transitions. Word has length 236 [2021-11-16 22:42:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:42,131 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1232 transitions. [2021-11-16 22:42:42,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-16 22:42:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1232 transitions. [2021-11-16 22:42:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-11-16 22:42:42,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:42:42,134 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-16 22:42:42,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-16 22:42:42,134 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:42:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:42:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 533574185, now seen corresponding path program 2 times [2021-11-16 22:42:42,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:42:42,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010792023] [2021-11-16 22:42:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:42:42,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:42:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 22:42:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:42:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 22:42:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 22:42:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 22:42:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:42:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 22:42:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 22:42:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:42:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:42:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:42:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:42:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 22:42:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 22:42:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-16 22:42:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-16 22:42:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-11-16 22:42:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:42:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:42:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-16 22:42:42,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:42:42,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010792023] [2021-11-16 22:42:42,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010792023] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:42:42,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:42:42,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 22:42:42,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478643192] [2021-11-16 22:42:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:42:42,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 22:42:42,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:42:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 22:42:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:42:42,351 INFO L87 Difference]: Start difference. First operand 947 states and 1232 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 22:42:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:42:43,102 INFO L93 Difference]: Finished difference Result 1373 states and 1820 transitions. [2021-11-16 22:42:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 22:42:43,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 236 [2021-11-16 22:42:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:42:43,103 INFO L225 Difference]: With dead ends: 1373 [2021-11-16 22:42:43,103 INFO L226 Difference]: Without dead ends: 0 [2021-11-16 22:42:43,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-11-16 22:42:43,105 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 863 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 22:42:43,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 886 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 22:42:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-16 22:42:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-16 22:42:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-16 22:42:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-16 22:42:43,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2021-11-16 22:42:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:42:43,106 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-16 22:42:43,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 5 states have internal predecessors, (137), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 22:42:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-16 22:42:43,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-16 22:42:43,108 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 22:42:43,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-16 22:42:43,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-16 22:45:02,861 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2021-11-16 22:45:02,862 INFO L854 garLoopResultBuilder]: At program point kfreeENTRY(lines 2594 2596) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse1 (= |old(#valid)| |#valid|))) (and (or .cse0 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) .cse1) (or .cse0 .cse2 .cse1) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2 .cse1))) [2021-11-16 22:45:02,862 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 2594 2596) no Hoare annotation was computed. [2021-11-16 22:45:02,862 INFO L858 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2021-11-16 22:45:02,862 INFO L861 garLoopResultBuilder]: At program point ipmi_destroy_userENTRY(lines 2553 2555) the Hoare annotation is: true [2021-11-16 22:45:02,862 INFO L858 garLoopResultBuilder]: For program point ipmi_destroy_userFINAL(lines 2553 2555) no Hoare annotation was computed. [2021-11-16 22:45:02,862 INFO L858 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeFINAL(lines 2470 2484) no Hoare annotation was computed. [2021-11-16 22:45:02,862 INFO L854 garLoopResultBuilder]: At program point L2478(line 2478) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (not (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1 (not (<= (+ 5 |old(~ldv_count_2~0)|) ~ldv_count_1~0))) (or .cse0 (not (<= 6 ~ldv_count_1~0)) (not (= |old(~ldv_count_2~0)| 0))) (or .cse2 .cse1) (or .cse2 (not (<= (+ |old(~ldv_count_2~0)| 1) ~ldv_count_1~0))))) [2021-11-16 22:45:02,862 INFO L858 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2021-11-16 22:45:02,862 INFO L858 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2021-11-16 22:45:02,862 INFO L854 garLoopResultBuilder]: At program point ldv_device_create_file_dev_attr_of_sensor_device_attributeENTRY(lines 2470 2484) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (not (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2 (not (<= (+ 5 |old(~ldv_count_2~0)|) ~ldv_count_1~0))) (or .cse3 (not (<= (+ |old(~ldv_count_2~0)| 1) ~ldv_count_1~0)) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (or .cse3 .cse0 .cse2) (or (not (<= (+ 2 |old(~ldv_count_2~0)|) ~ldv_count_1~0)) .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (or .cse1 (not (<= 6 ~ldv_count_1~0)) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0)))) [2021-11-16 22:45:02,863 INFO L858 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2021-11-16 22:45:02,863 INFO L858 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2021-11-16 22:45:02,863 INFO L861 garLoopResultBuilder]: At program point wait_for_completionENTRY(lines 2590 2592) the Hoare annotation is: true [2021-11-16 22:45:02,863 INFO L858 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2021-11-16 22:45:02,863 INFO L858 garLoopResultBuilder]: For program point wait_for_completionFINAL(lines 2590 2592) no Hoare annotation was computed. [2021-11-16 22:45:02,863 INFO L858 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 2545 2547) no Hoare annotation was computed. [2021-11-16 22:45:02,863 INFO L861 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 2545 2547) the Hoare annotation is: true [2021-11-16 22:45:02,863 INFO L858 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2021-11-16 22:45:02,863 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2412 2417) no Hoare annotation was computed. [2021-11-16 22:45:02,864 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2412 2417) the Hoare annotation is: true [2021-11-16 22:45:02,864 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2021-11-16 22:45:02,864 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2021-11-16 22:45:02,864 INFO L854 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-16 22:45:02,864 INFO L858 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2021-11-16 22:45:02,864 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2021-11-16 22:45:02,864 INFO L854 garLoopResultBuilder]: At program point kzallocENTRY(lines 1658 1665) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-16 22:45:02,864 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(lines 1658 1665) no Hoare annotation was computed. [2021-11-16 22:45:02,864 INFO L854 garLoopResultBuilder]: At program point kmallocENTRY(lines 1649 1656) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-16 22:45:02,864 INFO L854 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-16 22:45:02,864 INFO L858 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2021-11-16 22:45:02,865 INFO L861 garLoopResultBuilder]: At program point L1646-2(lines 1644 1647) the Hoare annotation is: true [2021-11-16 22:45:02,865 INFO L858 garLoopResultBuilder]: For program point kmallocFINAL(lines 1649 1656) no Hoare annotation was computed. [2021-11-16 22:45:02,865 INFO L858 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2021-11-16 22:45:02,865 INFO L861 garLoopResultBuilder]: At program point L1567(lines 1564 1569) the Hoare annotation is: true [2021-11-16 22:45:02,865 INFO L861 garLoopResultBuilder]: At program point L1583(lines 1578 1585) the Hoare annotation is: true [2021-11-16 22:45:02,865 INFO L858 garLoopResultBuilder]: For program point extract_valueFINAL(lines 1676 1683) no Hoare annotation was computed. [2021-11-16 22:45:02,865 INFO L858 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2021-11-16 22:45:02,865 INFO L861 garLoopResultBuilder]: At program point L1575(lines 1570 1577) the Hoare annotation is: true [2021-11-16 22:45:02,865 INFO L861 garLoopResultBuilder]: At program point extract_valueENTRY(lines 1676 1683) the Hoare annotation is: true [2021-11-16 22:45:02,866 INFO L858 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2021-11-16 22:45:02,866 INFO L861 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2021-11-16 22:45:02,866 INFO L854 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-11-16 22:45:02,866 INFO L861 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2021-11-16 22:45:02,866 INFO L861 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2021-11-16 22:45:02,866 INFO L858 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2021-11-16 22:45:02,866 INFO L858 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2021-11-16 22:45:02,866 INFO L858 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2021-11-16 22:45:02,866 INFO L861 garLoopResultBuilder]: At program point L2226(lines 2201 2236) the Hoare annotation is: true [2021-11-16 22:45:02,867 INFO L861 garLoopResultBuilder]: At program point L2224(lines 2201 2236) the Hoare annotation is: true [2021-11-16 22:45:02,867 INFO L861 garLoopResultBuilder]: At program point L2220(lines 2201 2236) the Hoare annotation is: true [2021-11-16 22:45:02,867 INFO L861 garLoopResultBuilder]: At program point L2218(lines 2201 2236) the Hoare annotation is: true [2021-11-16 22:45:02,867 INFO L861 garLoopResultBuilder]: At program point L2216(lines 2201 2236) the Hoare annotation is: true [2021-11-16 22:45:02,867 INFO L861 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2021-11-16 22:45:02,867 INFO L858 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2021-11-16 22:45:02,867 INFO L858 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2021-11-16 22:45:02,867 INFO L854 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-11-16 22:45:02,867 INFO L858 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2021-11-16 22:45:02,868 INFO L858 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2021-11-16 22:45:02,868 INFO L861 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2021-11-16 22:45:02,868 INFO L861 garLoopResultBuilder]: At program point L2582(lines 2581 2583) the Hoare annotation is: true [2021-11-16 22:45:02,868 INFO L858 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2021-11-16 22:45:02,868 INFO L861 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2021-11-16 22:45:02,868 INFO L858 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2021-11-16 22:45:02,868 INFO L854 garLoopResultBuilder]: At program point ibmpex_bmc_deleteENTRY(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-11-16 22:45:02,868 INFO L858 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2021-11-16 22:45:02,868 INFO L858 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2021-11-16 22:45:02,868 INFO L861 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2021-11-16 22:45:02,869 INFO L858 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2021-11-16 22:45:02,869 INFO L861 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2021-11-16 22:45:02,869 INFO L858 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2021-11-16 22:45:02,869 INFO L861 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 2424 2429) the Hoare annotation is: true [2021-11-16 22:45:02,869 INFO L858 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 2424 2429) no Hoare annotation was computed. [2021-11-16 22:45:02,869 INFO L861 garLoopResultBuilder]: At program point ipmi_free_recv_msgENTRY(lines 2556 2558) the Hoare annotation is: true [2021-11-16 22:45:02,869 INFO L858 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2021-11-16 22:45:02,869 INFO L858 garLoopResultBuilder]: For program point ipmi_free_recv_msgFINAL(lines 2556 2558) no Hoare annotation was computed. [2021-11-16 22:45:02,869 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1634 1643) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 .cse2))) [2021-11-16 22:45:02,870 INFO L858 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2021-11-16 22:45:02,870 INFO L858 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2021-11-16 22:45:02,870 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2021-11-16 22:45:02,870 INFO L861 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2021-11-16 22:45:02,870 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2021-11-16 22:45:02,870 INFO L858 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2021-11-16 22:45:02,870 INFO L858 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2021-11-16 22:45:02,870 INFO L861 garLoopResultBuilder]: At program point L2561(lines 2560 2562) the Hoare annotation is: true [2021-11-16 22:45:02,870 INFO L858 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2021-11-16 22:45:02,871 INFO L858 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2021-11-16 22:45:02,871 INFO L854 garLoopResultBuilder]: At program point L2573(lines 2572 2574) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2021-11-16 22:45:02,871 INFO L861 garLoopResultBuilder]: At program point L1708(lines 1698 1718) the Hoare annotation is: true [2021-11-16 22:45:02,871 INFO L858 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2021-11-16 22:45:02,871 INFO L854 garLoopResultBuilder]: At program point ibmpex_send_messageENTRY(lines 1695 1719) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2021-11-16 22:45:02,871 INFO L854 garLoopResultBuilder]: At program point L1701(lines 1698 1718) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or .cse0 .cse1 (not (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0))) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (not (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse2) (or .cse0 .cse3 (not (<= 6 ~ldv_count_1~0)) (not (= ~ldv_count_2~0 0))))) [2021-11-16 22:45:02,871 INFO L858 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2021-11-16 22:45:02,871 INFO L858 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2021-11-16 22:45:02,872 INFO L861 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 2539 2541) the Hoare annotation is: true [2021-11-16 22:45:02,872 INFO L858 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 2539 2541) no Hoare annotation was computed. [2021-11-16 22:45:02,872 INFO L858 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2021-11-16 22:45:02,872 INFO L854 garLoopResultBuilder]: At program point L2249-1(lines 2238 2252) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,872 INFO L854 garLoopResultBuilder]: At program point L2249(line 2249) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,872 INFO L858 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2021-11-16 22:45:02,872 INFO L858 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2021-11-16 22:45:02,872 INFO L854 garLoopResultBuilder]: At program point L2514(lines 2513 2515) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,873 INFO L861 garLoopResultBuilder]: At program point L2316(lines 2302 2320) the Hoare annotation is: true [2021-11-16 22:45:02,873 INFO L858 garLoopResultBuilder]: For program point L2349(lines 2349 2364) no Hoare annotation was computed. [2021-11-16 22:45:02,873 INFO L854 garLoopResultBuilder]: At program point L2184(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,873 INFO L854 garLoopResultBuilder]: At program point L2118(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2021-11-16 22:45:02,873 INFO L854 garLoopResultBuilder]: At program point L2085(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,873 INFO L858 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2021-11-16 22:45:02,873 INFO L858 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2021-11-16 22:45:02,873 INFO L858 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2021-11-16 22:45:02,874 INFO L854 garLoopResultBuilder]: At program point L2383(line 2383) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,874 INFO L854 garLoopResultBuilder]: At program point L2284(lines 2254 2286) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,874 INFO L858 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2021-11-16 22:45:02,874 INFO L854 garLoopResultBuilder]: At program point L2384(lines 2379 2386) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,874 INFO L858 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2021-11-16 22:45:02,874 INFO L854 garLoopResultBuilder]: At program point L2351(line 2351) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,874 INFO L858 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2021-11-16 22:45:02,874 INFO L858 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2021-11-16 22:45:02,874 INFO L854 garLoopResultBuilder]: At program point L2550(lines 2549 2551) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,875 INFO L854 garLoopResultBuilder]: At program point L2517(lines 2516 2518) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,875 INFO L861 garLoopResultBuilder]: At program point L2319(lines 2295 2321) the Hoare annotation is: true [2021-11-16 22:45:02,875 INFO L858 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2021-11-16 22:45:02,875 INFO L854 garLoopResultBuilder]: At program point L2122(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,875 INFO L858 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2021-11-16 22:45:02,875 INFO L854 garLoopResultBuilder]: At program point L1726(line 1726) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,875 INFO L858 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2021-11-16 22:45:02,875 INFO L854 garLoopResultBuilder]: At program point L1594(lines 1590 1596) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,876 INFO L858 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2021-11-16 22:45:02,876 INFO L858 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2021-11-16 22:45:02,876 INFO L854 garLoopResultBuilder]: At program point L2189(line 2189) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,876 INFO L858 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2021-11-16 22:45:02,876 INFO L858 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2021-11-16 22:45:02,876 INFO L858 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2021-11-16 22:45:02,876 INFO L858 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2021-11-16 22:45:02,876 INFO L854 garLoopResultBuilder]: At program point L1727(line 1727) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,876 INFO L858 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2021-11-16 22:45:02,877 INFO L854 garLoopResultBuilder]: At program point L2520(lines 2519 2521) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,877 INFO L858 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2021-11-16 22:45:02,877 INFO L854 garLoopResultBuilder]: At program point L2355(line 2355) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,877 INFO L854 garLoopResultBuilder]: At program point L2190(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,877 INFO L854 garLoopResultBuilder]: At program point L2124(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,877 INFO L858 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2021-11-16 22:45:02,877 INFO L858 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2021-11-16 22:45:02,877 INFO L854 garLoopResultBuilder]: At program point L1761(line 1761) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,877 INFO L858 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2021-11-16 22:45:02,878 INFO L858 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2021-11-16 22:45:02,878 INFO L858 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2021-11-16 22:45:02,878 INFO L858 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2021-11-16 22:45:02,878 INFO L854 garLoopResultBuilder]: At program point L2191(line 2191) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,878 INFO L854 garLoopResultBuilder]: At program point L1762(line 1762) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,878 INFO L858 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2021-11-16 22:45:02,878 INFO L858 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2021-11-16 22:45:02,878 INFO L858 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2021-11-16 22:45:02,878 INFO L854 garLoopResultBuilder]: At program point L2192(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,879 INFO L858 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2021-11-16 22:45:02,879 INFO L858 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2021-11-16 22:45:02,879 INFO L858 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2021-11-16 22:45:02,879 INFO L854 garLoopResultBuilder]: At program point L2292(lines 2287 2294) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2021-11-16 22:45:02,879 INFO L858 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2021-11-16 22:45:02,879 INFO L858 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2021-11-16 22:45:02,879 INFO L858 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2021-11-16 22:45:02,879 INFO L854 garLoopResultBuilder]: At program point L2127(line 2127) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,879 INFO L858 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2021-11-16 22:45:02,880 INFO L854 garLoopResultBuilder]: At program point L1929(lines 1916 1931) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,880 INFO L854 garLoopResultBuilder]: At program point L1863(lines 1849 1869) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,880 INFO L854 garLoopResultBuilder]: At program point L2392(lines 2387 2394) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2021-11-16 22:45:02,880 INFO L858 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2021-11-16 22:45:02,880 INFO L854 garLoopResultBuilder]: At program point L2359(line 2359) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,880 INFO L854 garLoopResultBuilder]: At program point L2194(lines 2131 2196) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,880 INFO L854 garLoopResultBuilder]: At program point L2128(lines 2012 2130) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,881 INFO L854 garLoopResultBuilder]: At program point L2095(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,881 INFO L858 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2021-11-16 22:45:02,881 INFO L858 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2021-11-16 22:45:02,881 INFO L858 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2021-11-16 22:45:02,881 INFO L854 garLoopResultBuilder]: At program point L1865(lines 1849 1869) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,881 INFO L854 garLoopResultBuilder]: At program point L1767(lines 1755 1769) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,881 INFO L854 garLoopResultBuilder]: At program point L1734(line 1734) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,881 INFO L858 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2021-11-16 22:45:02,881 INFO L854 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2021-11-16 22:45:02,882 INFO L854 garLoopResultBuilder]: At program point L2527(lines 2526 2528) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,882 INFO L858 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2021-11-16 22:45:02,882 INFO L854 garLoopResultBuilder]: At program point L2264(line 2264) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,882 INFO L854 garLoopResultBuilder]: At program point L2033(line 2033) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,882 INFO L858 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2021-11-16 22:45:02,882 INFO L854 garLoopResultBuilder]: At program point L1868(lines 1842 1870) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,882 INFO L858 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2021-11-16 22:45:02,882 INFO L854 garLoopResultBuilder]: At program point L2100(line 2100) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,883 INFO L858 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2021-11-16 22:45:02,883 INFO L854 garLoopResultBuilder]: At program point L1968(lines 1953 1974) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2021-11-16 22:45:02,883 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-16 22:45:02,883 INFO L854 garLoopResultBuilder]: At program point L2365(lines 2337 2377) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,883 INFO L858 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2021-11-16 22:45:02,883 INFO L854 garLoopResultBuilder]: At program point L2101(line 2101) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,883 INFO L858 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2021-11-16 22:45:02,883 INFO L858 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2021-11-16 22:45:02,884 INFO L854 garLoopResultBuilder]: At program point L1738(lines 1720 1740) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,884 INFO L854 garLoopResultBuilder]: At program point L2498(lines 2486 2500) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2021-11-16 22:45:02,884 INFO L858 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2021-11-16 22:45:02,884 INFO L854 garLoopResultBuilder]: At program point L2399(line 2399) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,884 INFO L858 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2021-11-16 22:45:02,884 INFO L854 garLoopResultBuilder]: At program point L1970(lines 1953 1974) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2021-11-16 22:45:02,884 INFO L854 garLoopResultBuilder]: At program point L2565(lines 2564 2566) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2021-11-16 22:45:02,884 INFO L854 garLoopResultBuilder]: At program point L2466(lines 2462 2468) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)))) [2021-11-16 22:45:02,884 INFO L854 garLoopResultBuilder]: At program point L2400(lines 2395 2402) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,885 INFO L858 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2021-11-16 22:45:02,885 INFO L858 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2021-11-16 22:45:02,885 INFO L858 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2021-11-16 22:45:02,885 INFO L858 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2021-11-16 22:45:02,885 INFO L854 garLoopResultBuilder]: At program point L2005(line 2005) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2021-11-16 22:45:02,885 INFO L858 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2021-11-16 22:45:02,885 INFO L854 garLoopResultBuilder]: At program point L1609(lines 1603 1611) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,886 INFO L854 garLoopResultBuilder]: At program point L2369(lines 2337 2377) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,886 INFO L854 garLoopResultBuilder]: At program point L1973(lines 1948 1975) the Hoare annotation is: (let ((.cse1 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~sensor_type~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= 6 ~ldv_count_1~0) .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse3 .cse2))) [2021-11-16 22:45:02,886 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-16 22:45:02,886 INFO L858 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2021-11-16 22:45:02,886 INFO L858 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2021-11-16 22:45:02,886 INFO L854 garLoopResultBuilder]: At program point L2139(line 2139) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,887 INFO L858 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2021-11-16 22:45:02,887 INFO L861 garLoopResultBuilder]: At program point L2569(lines 2568 2570) the Hoare annotation is: true [2021-11-16 22:45:02,887 INFO L861 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2021-11-16 22:45:02,887 INFO L858 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2021-11-16 22:45:02,887 INFO L858 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2021-11-16 22:45:02,887 INFO L858 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2021-11-16 22:45:02,887 INFO L854 garLoopResultBuilder]: At program point L2009(lines 1976 2011) the Hoare annotation is: (let ((.cse4 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse5 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse1 (<= (+ |ULTIMATE.start_create_sensor_#res#1| 12) 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) .cse3) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse5 .cse1 (= ~ldv_count_2~0 0) .cse2))) [2021-11-16 22:45:02,887 INFO L854 garLoopResultBuilder]: At program point L2340(line 2340) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2021-11-16 22:45:02,887 INFO L858 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2021-11-16 22:45:02,888 INFO L858 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2021-11-16 22:45:02,888 INFO L854 garLoopResultBuilder]: At program point L2274-2(lines 2274 2281) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,888 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-16 22:45:02,888 INFO L854 garLoopResultBuilder]: At program point L2076(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) .cse0 .cse2 (= ~ldv_count_2~0 0)) (and .cse3 .cse1) (and .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse3 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2021-11-16 22:45:02,888 INFO L858 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2021-11-16 22:45:02,888 INFO L854 garLoopResultBuilder]: At program point L1746(line 1746) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,888 INFO L858 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2021-11-16 22:45:02,888 INFO L858 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2021-11-16 22:45:02,888 INFO L861 garLoopResultBuilder]: At program point L2374(lines 2337 2377) the Hoare annotation is: true [2021-11-16 22:45:02,889 INFO L854 garLoopResultBuilder]: At program point L2407(line 2407) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,889 INFO L854 garLoopResultBuilder]: At program point L1945(lines 1932 1947) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse1 (= |ULTIMATE.start_ibmpex_find_sensors_~tmp___1~1#1| 0)) (.cse2 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 .cse1 .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse1 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 .cse2 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)))) [2021-11-16 22:45:02,889 INFO L854 garLoopResultBuilder]: At program point L1747(line 1747) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,889 INFO L858 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2021-11-16 22:45:02,889 INFO L854 garLoopResultBuilder]: At program point L2408(lines 2403 2410) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,889 INFO L858 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2021-11-16 22:45:02,890 INFO L854 garLoopResultBuilder]: At program point L2078(lines 2024 2129) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2021-11-16 22:45:02,890 INFO L858 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2021-11-16 22:45:02,890 INFO L858 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2021-11-16 22:45:02,890 INFO L861 garLoopResultBuilder]: At program point L2376(lines 2327 2378) the Hoare annotation is: true [2021-11-16 22:45:02,890 INFO L858 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2021-11-16 22:45:02,891 INFO L854 garLoopResultBuilder]: At program point L2178(line 2178) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,891 INFO L854 garLoopResultBuilder]: At program point L2112(line 2112) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2021-11-16 22:45:02,891 INFO L858 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2021-11-16 22:45:02,891 INFO L858 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2021-11-16 22:45:02,891 INFO L858 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2021-11-16 22:45:02,892 INFO L858 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2021-11-16 22:45:02,892 INFO L854 garLoopResultBuilder]: At program point L2113(line 2113) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2021-11-16 22:45:02,892 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-16 22:45:02,892 INFO L854 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,893 INFO L854 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,893 INFO L858 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-11-16 22:45:02,893 INFO L861 garLoopResultBuilder]: At program point L2576(lines 2575 2577) the Hoare annotation is: true [2021-11-16 22:45:02,893 INFO L854 garLoopResultBuilder]: At program point L2510(lines 2501 2512) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2021-11-16 22:45:02,893 INFO L858 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2021-11-16 22:45:02,893 INFO L854 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,894 INFO L854 garLoopResultBuilder]: At program point L2543-2(lines 2542 2544) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,894 INFO L854 garLoopResultBuilder]: At program point L2114(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2021-11-16 22:45:02,894 INFO L854 garLoopResultBuilder]: At program point L2081(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,894 INFO L858 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2021-11-16 22:45:02,894 INFO L858 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2021-11-16 22:45:02,894 INFO L854 garLoopResultBuilder]: At program point L1983(line 1983) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2021-11-16 22:45:02,894 INFO L858 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2021-11-16 22:45:02,895 INFO L854 garLoopResultBuilder]: At program point L1752(lines 1741 1754) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,895 INFO L861 garLoopResultBuilder]: At program point L2314(lines 2302 2320) the Hoare annotation is: true [2021-11-16 22:45:02,895 INFO L854 garLoopResultBuilder]: At program point L2116(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,895 INFO L854 garLoopResultBuilder]: At program point L2083(lines 2024 2129) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2021-11-16 22:45:02,895 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 2536 2538) no Hoare annotation was computed. [2021-11-16 22:45:02,895 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2021-11-16 22:45:02,895 INFO L861 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 2536 2538) the Hoare annotation is: true [2021-11-16 22:45:02,898 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:45:02,899 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 22:45:02,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:02,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:02,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:45:02 BoogieIcfgContainer [2021-11-16 22:45:02,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 22:45:02,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 22:45:02,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 22:45:02,961 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 22:45:02,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:42:26" (3/4) ... [2021-11-16 22:45:02,964 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-16 22:45:02,979 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2021-11-16 22:45:02,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2021-11-16 22:45:02,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2021-11-16 22:45:03,005 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 144 nodes and edges [2021-11-16 22:45:03,006 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2021-11-16 22:45:03,007 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-16 22:45:03,008 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-16 22:45:03,009 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-16 22:45:03,010 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-16 22:45:03,038 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && \result + 12 <= 0) && j <= 2) && ldv_count_2 + 1 <= ldv_count_1) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2)) || ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && \result + 12 <= 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && \result + 12 <= 0) && ldv_count_2 == 0) && j <= 2) [2021-11-16 22:45:03,040 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(ldv_count_2 + 1 <= ldv_count_1)) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= ldv_count_1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) [2021-11-16 22:45:03,041 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(ldv_count_2 + 1 <= ldv_count_1)) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= ldv_count_1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) [2021-11-16 22:45:03,110 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-16 22:45:03,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 22:45:03,111 INFO L158 Benchmark]: Toolchain (without parser) took 158957.73ms. Allocated memory was 88.1MB in the beginning and 599.8MB in the end (delta: 511.7MB). Free memory was 53.0MB in the beginning and 211.8MB in the end (delta: -158.8MB). Peak memory consumption was 352.3MB. Max. memory is 16.1GB. [2021-11-16 22:45:03,111 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 22:45:03,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 729.80ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.8MB in the beginning and 78.9MB in the end (delta: -26.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2021-11-16 22:45:03,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.23ms. Allocated memory is still 113.2MB. Free memory was 78.9MB in the beginning and 71.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 22:45:03,112 INFO L158 Benchmark]: Boogie Preprocessor took 90.13ms. Allocated memory is still 113.2MB. Free memory was 71.6MB in the beginning and 64.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-16 22:45:03,112 INFO L158 Benchmark]: RCFGBuilder took 1139.08ms. Allocated memory is still 113.2MB. Free memory was 64.7MB in the beginning and 53.2MB in the end (delta: 11.5MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2021-11-16 22:45:03,113 INFO L158 Benchmark]: TraceAbstraction took 156744.43ms. Allocated memory was 113.2MB in the beginning and 599.8MB in the end (delta: 486.5MB). Free memory was 52.6MB in the beginning and 240.9MB in the end (delta: -188.2MB). Peak memory consumption was 349.2MB. Max. memory is 16.1GB. [2021-11-16 22:45:03,113 INFO L158 Benchmark]: Witness Printer took 149.57ms. Allocated memory is still 599.8MB. Free memory was 240.9MB in the beginning and 211.8MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-16 22:45:03,115 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.10ms. Allocated memory is still 88.1MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 729.80ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.8MB in the beginning and 78.9MB in the end (delta: -26.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.23ms. Allocated memory is still 113.2MB. Free memory was 78.9MB in the beginning and 71.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.13ms. Allocated memory is still 113.2MB. Free memory was 71.6MB in the beginning and 64.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1139.08ms. Allocated memory is still 113.2MB. Free memory was 64.7MB in the beginning and 53.2MB in the end (delta: 11.5MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 156744.43ms. Allocated memory was 113.2MB in the beginning and 599.8MB in the end (delta: 486.5MB). Free memory was 52.6MB in the beginning and 240.9MB in the end (delta: -188.2MB). Peak memory consumption was 349.2MB. Max. memory is 16.1GB. * Witness Printer took 149.57ms. Allocated memory is still 599.8MB. Free memory was 240.9MB in the beginning and 211.8MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. 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: 2415]: 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 18 procedures, 275 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 156.6s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 139.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8332 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7712 mSDsluCounter, 22248 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14844 mSDsCounter, 2848 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7410 IncrementalHoareTripleChecker+Invalid, 10258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2848 mSolverCounterUnsat, 7404 mSDtfsCounter, 7410 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1234 GetRequests, 1134 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1508occurred in iteration=11, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 9153 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 3879 PreInvPairs, 4613 NumberOfFragments, 4151 HoareAnnotationTreeSize, 3879 FomulaSimplifications, 489212 FormulaSimplificationTreeSizeReduction, 118.2s HoareSimplificationTime, 134 FomulaSimplificationsInter, 37311994 FormulaSimplificationTreeSizeReductionInter, 21.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2976 NumberOfCodeBlocks, 2976 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3144 ConstructedInterpolants, 0 QuantifiedInterpolants, 5246 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2786 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 1546/1550 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: 2287]: Loop Invariant Derived loop invariant: (6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1644]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2549]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1849]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2572]: Loop Invariant [2021-11-16 22:45:03,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,146 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(ldv_count_2 + 1 <= ldv_count_1)) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= ldv_count_1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) - InvariantResult [Line: 1564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2131]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1720]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2513]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1948]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2542]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1603]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 1) && ldv_count_2 + 1 <= ldv_count_1) - InvariantResult [Line: 1570]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1590]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && tmp___1 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && tmp___1 == 0) && ldv_count_2 == 0)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && tmp___1 == 0) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && tmp___1 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2560]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2519]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2526]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1976]: Loop Invariant Derived loop invariant: (((((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && \result + 12 <= 0) && j <= 2) && ldv_count_2 + 1 <= ldv_count_1) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2)) || ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && \result + 12 <= 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && \result + 12 <= 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2501]: Loop Invariant Derived loop invariant: (6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: (6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 2) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2516]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: (((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 1) && ldv_count_2 + 1 <= ldv_count_1) - InvariantResult [Line: 1755]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2012]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1916]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1741]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2254]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j <= 2) && ldv_count_2 + 1 <= ldv_count_1)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) && j <= 2) - InvariantResult [Line: 2403]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2462]: Loop Invariant Derived loop invariant: ((((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j == 0) && 5 + ldv_count_2 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2)) || (((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && j == 0) && ldv_count_2 == 0) - InvariantResult [Line: 2295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2024]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1698]: Loop Invariant [2021-11-16 22:45:03,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 22:45:03,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 22:45:03,163 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$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(ldv_count_2 + 1 <= ldv_count_1)) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(5 + ldv_count_2 <= ldv_count_1)) || !(1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) || !(6 <= ldv_count_1)) || !(ldv_count_2 == 0)) - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: (((((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ldv_count_2 + 1 <= ldv_count_1)) || (((sensor_type == 2 && 6 <= ldv_count_1) && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0)) || ((sensor_type == 2 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 1849]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2327]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1578]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2387]: Loop Invariant Derived loop invariant: (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2575]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2238]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2568]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2395]: Loop Invariant Derived loop invariant: ((((6 <= ldv_count_1 && ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && ldv_count_2 == 0) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && 5 + ldv_count_2 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && ldv_count_2 + 1 <= ldv_count_1)) || (ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) - InvariantResult [Line: 2486]: Loop Invariant Derived loop invariant: (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 1 <= ldv_call_dev_attr_of_sensor_device_attribute) && j <= 2) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && j == 0) && ldv_count_2 + 1 <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1 && 2 + ldv_count_2 <= ldv_count_1) && j <= 2) - InvariantResult [Line: 2581]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-16 22:45:03,194 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