./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 f4b24e32 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.2-?-f4b24e3 [2022-07-13 23:22:44,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:22:44,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:22:44,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:22:44,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:22:44,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:22:44,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:22:44,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:22:44,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:22:44,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:22:44,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:22:44,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:22:44,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:22:44,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:22:44,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:22:44,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:22:44,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:22:44,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:22:44,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:22:44,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:22:44,111 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:22:44,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:22:44,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:22:44,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:22:44,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:22:44,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:22:44,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:22:44,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:22:44,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:22:44,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:22:44,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:22:44,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:22:44,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:22:44,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:22:44,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:22:44,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:22:44,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:22:44,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:22:44,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:22:44,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:22:44,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:22:44,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:22:44,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 23:22:44,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:22:44,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:22:44,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:22:44,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:22:44,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:22:44,162 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:22:44,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:22:44,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:22:44,163 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:22:44,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:22:44,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 23:22:44,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:22:44,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:22:44,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:22:44,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:22:44,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:22:44,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:22:44,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:22:44,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:22:44,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:22:44,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:22:44,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:22:44,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:22:44,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:22:44,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:22:44,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 23:22:44,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 23:22:44,167 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:22:44,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:22:44,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:22:44,168 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 [2022-07-13 23:22:44,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:22:44,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:22:44,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:22:44,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:22:44,405 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:22:44,406 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 [2022-07-13 23:22:44,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277bf1048/85e46f47769249b89c4528aa2caa5f95/FLAG6d6201192 [2022-07-13 23:22:45,025 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:22:45,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2022-07-13 23:22:45,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277bf1048/85e46f47769249b89c4528aa2caa5f95/FLAG6d6201192 [2022-07-13 23:22:45,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277bf1048/85e46f47769249b89c4528aa2caa5f95 [2022-07-13 23:22:45,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:22:45,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:22:45,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:22:45,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:22:45,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:22:45,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:22:45" (1/1) ... [2022-07-13 23:22:45,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@766815bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:45, skipping insertion in model container [2022-07-13 23:22:45,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:22:45" (1/1) ... [2022-07-13 23:22:45,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:22:45,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:22:46,301 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] [2022-07-13 23:22:46,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:22:46,335 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:22:46,439 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] [2022-07-13 23:22:46,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:22:46,464 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:22:46,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46 WrapperNode [2022-07-13 23:22:46,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:22:46,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:22:46,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:22:46,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:22:46,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,576 INFO L137 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 48, calls inlined = 43, statements flattened = 1101 [2022-07-13 23:22:46,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:22:46,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:22:46,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:22:46,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:22:46,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:22:46,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:22:46,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:22:46,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:22:46,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (1/1) ... [2022-07-13 23:22:46,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:22:46,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:22:46,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 23:22:46,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 23:22:46,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 23:22:46,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 23:22:46,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 23:22:46,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 23:22:46,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:22:46,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:22:46,749 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 23:22:46,750 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 23:22:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 23:22:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-13 23:22:46,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-13 23:22:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2022-07-13 23:22:46,750 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2022-07-13 23:22:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:22:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:22:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2022-07-13 23:22:46,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2022-07-13 23:22:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:22:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2022-07-13 23:22:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2022-07-13 23:22:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:22:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 23:22:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2022-07-13 23:22:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2022-07-13 23:22:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:22:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-13 23:22:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-13 23:22:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2022-07-13 23:22:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2022-07-13 23:22:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-13 23:22:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-13 23:22:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:22:46,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:22:46,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-07-13 23:22:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-07-13 23:22:46,752 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-07-13 23:22:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-07-13 23:22:46,752 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-13 23:22:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-13 23:22:46,752 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-13 23:22:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-13 23:22:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 23:22:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-13 23:22:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-13 23:22:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2022-07-13 23:22:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2022-07-13 23:22:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 23:22:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-13 23:22:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-13 23:22:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:22:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:22:46,959 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:22:46,961 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:22:47,625 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:22:47,633 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:22:47,633 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 23:22:47,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:22:47 BoogieIcfgContainer [2022-07-13 23:22:47,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:22:47,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:22:47,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:22:47,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:22:47,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:22:45" (1/3) ... [2022-07-13 23:22:47,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c5cdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:22:47, skipping insertion in model container [2022-07-13 23:22:47,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:22:46" (2/3) ... [2022-07-13 23:22:47,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c5cdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:22:47, skipping insertion in model container [2022-07-13 23:22:47,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:22:47" (3/3) ... [2022-07-13 23:22:47,641 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2022-07-13 23:22:47,652 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:22:47,653 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:22:47,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:22:47,700 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5810f68b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f75428 [2022-07-13 23:22:47,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:22:47,705 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) [2022-07-13 23:22:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 23:22:47,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:47,718 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:47,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:47,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1527877958, now seen corresponding path program 1 times [2022-07-13 23:22:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:47,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642010069] [2022-07-13 23:22:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 23:22:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:22:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:22:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:22:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 23:22:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 23:22:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:48,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642010069] [2022-07-13 23:22:48,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642010069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:48,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:48,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:22:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174531773] [2022-07-13 23:22:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:48,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:22:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:48,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:22:48,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:22:48,248 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) [2022-07-13 23:22:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:49,183 INFO L93 Difference]: Finished difference Result 678 states and 930 transitions. [2022-07-13 23:22:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:22:49,186 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 [2022-07-13 23:22:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:49,196 INFO L225 Difference]: With dead ends: 678 [2022-07-13 23:22:49,196 INFO L226 Difference]: Without dead ends: 375 [2022-07-13 23:22:49,200 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:49,203 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 325 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:49,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1359 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:22:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-07-13 23:22:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 263. [2022-07-13 23:22:49,252 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) [2022-07-13 23:22:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 346 transitions. [2022-07-13 23:22:49,255 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 346 transitions. Word has length 122 [2022-07-13 23:22:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:49,255 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 346 transitions. [2022-07-13 23:22:49,256 INFO L496 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) [2022-07-13 23:22:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 346 transitions. [2022-07-13 23:22:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 23:22:49,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:49,258 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:49,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 23:22:49,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:49,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1747602214, now seen corresponding path program 1 times [2022-07-13 23:22:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:49,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820946812] [2022-07-13 23:22:49,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:49,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 23:22:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:49,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820946812] [2022-07-13 23:22:49,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820946812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:49,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:49,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:22:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144242802] [2022-07-13 23:22:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:49,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:22:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:22:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:22:49,507 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) [2022-07-13 23:22:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:50,015 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2022-07-13 23:22:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:22:50,016 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 [2022-07-13 23:22:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:50,018 INFO L225 Difference]: With dead ends: 548 [2022-07-13 23:22:50,018 INFO L226 Difference]: Without dead ends: 293 [2022-07-13 23:22:50,019 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:50,020 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 155 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:50,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 825 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 23:22:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-13 23:22:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 264. [2022-07-13 23:22:50,034 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) [2022-07-13 23:22:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 347 transitions. [2022-07-13 23:22:50,035 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 347 transitions. Word has length 130 [2022-07-13 23:22:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:50,036 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 347 transitions. [2022-07-13 23:22:50,036 INFO L496 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) [2022-07-13 23:22:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 347 transitions. [2022-07-13 23:22:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 23:22:50,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:50,038 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:50,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 23:22:50,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash -329734684, now seen corresponding path program 1 times [2022-07-13 23:22:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:50,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548452206] [2022-07-13 23:22:50,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 23:22:50,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:50,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548452206] [2022-07-13 23:22:50,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548452206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:50,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:50,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:22:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172759657] [2022-07-13 23:22:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:50,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:22:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:22:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:22:50,197 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) [2022-07-13 23:22:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:50,855 INFO L93 Difference]: Finished difference Result 627 states and 845 transitions. [2022-07-13 23:22:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:22:50,856 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 [2022-07-13 23:22:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:50,858 INFO L225 Difference]: With dead ends: 627 [2022-07-13 23:22:50,858 INFO L226 Difference]: Without dead ends: 371 [2022-07-13 23:22:50,859 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:50,863 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 308 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:50,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1271 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 23:22:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-07-13 23:22:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 266. [2022-07-13 23:22:50,891 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) [2022-07-13 23:22:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2022-07-13 23:22:50,892 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 130 [2022-07-13 23:22:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:50,907 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2022-07-13 23:22:50,908 INFO L496 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) [2022-07-13 23:22:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2022-07-13 23:22:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 23:22:50,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:50,910 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:50,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 23:22:50,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1056468710, now seen corresponding path program 1 times [2022-07-13 23:22:50,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:50,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073306559] [2022-07-13 23:22:50,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 23:22:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073306559] [2022-07-13 23:22:51,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073306559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:51,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:51,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:22:51,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031192340] [2022-07-13 23:22:51,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:51,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:22:51,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:22:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:22:51,130 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) [2022-07-13 23:22:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:52,398 INFO L93 Difference]: Finished difference Result 863 states and 1155 transitions. [2022-07-13 23:22:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 23:22:52,398 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 [2022-07-13 23:22:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:52,403 INFO L225 Difference]: With dead ends: 863 [2022-07-13 23:22:52,403 INFO L226 Difference]: Without dead ends: 859 [2022-07-13 23:22:52,403 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:52,404 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 1105 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:52,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1322 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 23:22:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-07-13 23:22:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 772. [2022-07-13 23:22:52,433 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) [2022-07-13 23:22:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1021 transitions. [2022-07-13 23:22:52,436 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1021 transitions. Word has length 130 [2022-07-13 23:22:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:52,437 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 1021 transitions. [2022-07-13 23:22:52,437 INFO L496 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) [2022-07-13 23:22:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1021 transitions. [2022-07-13 23:22:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 23:22:52,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:52,438 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:52,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 23:22:52,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 88761714, now seen corresponding path program 1 times [2022-07-13 23:22:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:52,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305297422] [2022-07-13 23:22:52,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:52,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:22:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 23:22:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:52,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305297422] [2022-07-13 23:22:52,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305297422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:22:52,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46344872] [2022-07-13 23:22:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:52,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:22:52,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:22:52,574 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) [2022-07-13 23:22:52,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 23:22:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:52,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 23:22:52,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:22:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 23:22:52,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:22:52,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46344872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:52,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:22:52,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-13 23:22:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671867548] [2022-07-13 23:22:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:52,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:22:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:22:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:22:52,963 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) [2022-07-13 23:22:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:53,016 INFO L93 Difference]: Finished difference Result 1538 states and 2037 transitions. [2022-07-13 23:22:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:22:53,017 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 [2022-07-13 23:22:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:53,021 INFO L225 Difference]: With dead ends: 1538 [2022-07-13 23:22:53,021 INFO L226 Difference]: Without dead ends: 1280 [2022-07-13 23:22:53,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:22:53,023 INFO L413 NwaCegarLoop]: 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 [2022-07-13 23:22:53,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 990 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:22:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-07-13 23:22:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1025. [2022-07-13 23:22:53,073 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) [2022-07-13 23:22:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1354 transitions. [2022-07-13 23:22:53,077 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1354 transitions. Word has length 140 [2022-07-13 23:22:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:53,077 INFO L495 AbstractCegarLoop]: Abstraction has 1025 states and 1354 transitions. [2022-07-13 23:22:53,077 INFO L496 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) [2022-07-13 23:22:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1354 transitions. [2022-07-13 23:22:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 23:22:53,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:53,080 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:53,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 23:22:53,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:22:53,299 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1821132084, now seen corresponding path program 1 times [2022-07-13 23:22:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:53,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765881484] [2022-07-13 23:22:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:53,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:22:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:22:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 23:22:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 23:22:53,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765881484] [2022-07-13 23:22:53,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765881484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:53,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:53,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:22:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567000749] [2022-07-13 23:22:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:53,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:22:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:22:53,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:22:53,454 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) [2022-07-13 23:22:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:54,146 INFO L93 Difference]: Finished difference Result 2698 states and 3689 transitions. [2022-07-13 23:22:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:22:54,147 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 [2022-07-13 23:22:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:54,153 INFO L225 Difference]: With dead ends: 2698 [2022-07-13 23:22:54,153 INFO L226 Difference]: Without dead ends: 1681 [2022-07-13 23:22:54,171 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:54,172 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 291 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:54,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1562 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 23:22:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2022-07-13 23:22:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1033. [2022-07-13 23:22:54,263 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) [2022-07-13 23:22:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1362 transitions. [2022-07-13 23:22:54,266 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1362 transitions. Word has length 184 [2022-07-13 23:22:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:54,267 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1362 transitions. [2022-07-13 23:22:54,267 INFO L496 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) [2022-07-13 23:22:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1362 transitions. [2022-07-13 23:22:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 23:22:54,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:54,285 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:54,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 23:22:54,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1580348874, now seen corresponding path program 1 times [2022-07-13 23:22:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:54,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593194402] [2022-07-13 23:22:54,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:54,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:22:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:22:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 23:22:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 23:22:54,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593194402] [2022-07-13 23:22:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593194402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:54,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:22:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15063018] [2022-07-13 23:22:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:54,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:22:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:22:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:22:54,439 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) [2022-07-13 23:22:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:55,041 INFO L93 Difference]: Finished difference Result 2178 states and 2895 transitions. [2022-07-13 23:22:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:22:55,041 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 [2022-07-13 23:22:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:55,045 INFO L225 Difference]: With dead ends: 2178 [2022-07-13 23:22:55,045 INFO L226 Difference]: Without dead ends: 1153 [2022-07-13 23:22:55,048 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:55,048 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 155 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:55,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 827 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 23:22:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-07-13 23:22:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1037. [2022-07-13 23:22:55,086 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) [2022-07-13 23:22:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1366 transitions. [2022-07-13 23:22:55,089 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1366 transitions. Word has length 184 [2022-07-13 23:22:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:55,089 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1366 transitions. [2022-07-13 23:22:55,089 INFO L496 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) [2022-07-13 23:22:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1366 transitions. [2022-07-13 23:22:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 23:22:55,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:55,091 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:55,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 23:22:55,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 347923828, now seen corresponding path program 1 times [2022-07-13 23:22:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:55,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719851226] [2022-07-13 23:22:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:22:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:22:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 23:22:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 23:22:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719851226] [2022-07-13 23:22:55,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719851226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:55,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:55,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:22:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180948525] [2022-07-13 23:22:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:55,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:22:55,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:55,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:22:55,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:22:55,338 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) [2022-07-13 23:22:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:56,322 INFO L93 Difference]: Finished difference Result 3838 states and 5391 transitions. [2022-07-13 23:22:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:22:56,335 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 [2022-07-13 23:22:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:56,346 INFO L225 Difference]: With dead ends: 3838 [2022-07-13 23:22:56,347 INFO L226 Difference]: Without dead ends: 2809 [2022-07-13 23:22:56,350 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:56,350 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 636 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:56,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 2083 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:22:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-07-13 23:22:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 1045. [2022-07-13 23:22:56,482 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) [2022-07-13 23:22:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1374 transitions. [2022-07-13 23:22:56,485 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1374 transitions. Word has length 184 [2022-07-13 23:22:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:56,485 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1374 transitions. [2022-07-13 23:22:56,485 INFO L496 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) [2022-07-13 23:22:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1374 transitions. [2022-07-13 23:22:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-13 23:22:56,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:56,487 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:56,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 23:22:56,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash 830531558, now seen corresponding path program 1 times [2022-07-13 23:22:56,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:56,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871468561] [2022-07-13 23:22:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:22:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:22:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:22:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 23:22:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:56,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871468561] [2022-07-13 23:22:56,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871468561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:56,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:56,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:22:56,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965384337] [2022-07-13 23:22:56,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:56,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:22:56,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:22:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:22:56,808 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) [2022-07-13 23:22:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:57,799 INFO L93 Difference]: Finished difference Result 3946 states and 5543 transitions. [2022-07-13 23:22:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:22:57,800 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 [2022-07-13 23:22:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:57,809 INFO L225 Difference]: With dead ends: 3946 [2022-07-13 23:22:57,809 INFO L226 Difference]: Without dead ends: 2909 [2022-07-13 23:22:57,811 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:57,811 INFO L413 NwaCegarLoop]: 606 mSDtfsCounter, 737 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:57,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1950 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:22:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2022-07-13 23:22:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1124. [2022-07-13 23:22:57,871 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) [2022-07-13 23:22:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1483 transitions. [2022-07-13 23:22:57,878 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1483 transitions. Word has length 185 [2022-07-13 23:22:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:57,878 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1483 transitions. [2022-07-13 23:22:57,879 INFO L496 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) [2022-07-13 23:22:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1483 transitions. [2022-07-13 23:22:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-13 23:22:57,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:57,881 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:57,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 23:22:57,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:57,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1883377874, now seen corresponding path program 1 times [2022-07-13 23:22:57,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:57,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787271120] [2022-07-13 23:22:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:57,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:22:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:22:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:22:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 23:22:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:58,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787271120] [2022-07-13 23:22:58,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787271120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:22:58,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:22:58,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:22:58,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41846433] [2022-07-13 23:22:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:22:58,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:22:58,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:58,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:22:58,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:22:58,054 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) [2022-07-13 23:22:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:22:59,062 INFO L93 Difference]: Finished difference Result 4208 states and 5903 transitions. [2022-07-13 23:22:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:22:59,063 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 [2022-07-13 23:22:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:22:59,074 INFO L225 Difference]: With dead ends: 4208 [2022-07-13 23:22:59,075 INFO L226 Difference]: Without dead ends: 3092 [2022-07-13 23:22:59,078 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:22:59,078 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 686 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:22:59,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 2278 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:22:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-07-13 23:22:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1132. [2022-07-13 23:22:59,151 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) [2022-07-13 23:22:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1491 transitions. [2022-07-13 23:22:59,154 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1491 transitions. Word has length 185 [2022-07-13 23:22:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:22:59,154 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1491 transitions. [2022-07-13 23:22:59,154 INFO L496 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) [2022-07-13 23:22:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1491 transitions. [2022-07-13 23:22:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-13 23:22:59,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:22:59,156 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:22:59,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 23:22:59,156 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:22:59,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:22:59,157 INFO L85 PathProgramCache]: Analyzing trace with hash -124338905, now seen corresponding path program 1 times [2022-07-13 23:22:59,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:22:59,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502396058] [2022-07-13 23:22:59,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:59,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:22:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:22:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:22:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:22:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:22:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:22:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:22:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:22:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:22:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:22:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:22:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:22:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:22:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:22:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:22:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:22:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:22:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 23:22:59,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:22:59,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502396058] [2022-07-13 23:22:59,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502396058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:22:59,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926872273] [2022-07-13 23:22:59,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:22:59,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:22:59,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:22:59,333 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) [2022-07-13 23:22:59,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 23:22:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:22:59,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1934 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:22:59,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:22:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 23:22:59,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:22:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 23:22:59,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926872273] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:22:59,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:22:59,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-07-13 23:22:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918312570] [2022-07-13 23:22:59,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:22:59,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 23:22:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:22:59,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 23:22:59,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:22:59,916 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) [2022-07-13 23:23:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:23:00,969 INFO L93 Difference]: Finished difference Result 3782 states and 5259 transitions. [2022-07-13 23:23:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:23:00,969 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 [2022-07-13 23:23:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:23:00,979 INFO L225 Difference]: With dead ends: 3782 [2022-07-13 23:23:00,979 INFO L226 Difference]: Without dead ends: 2658 [2022-07-13 23:23:00,982 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:23:00,982 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 666 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:23:00,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1558 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:23:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-07-13 23:23:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1508. [2022-07-13 23:23:01,068 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) [2022-07-13 23:23:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2011 transitions. [2022-07-13 23:23:01,071 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2011 transitions. Word has length 186 [2022-07-13 23:23:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:23:01,072 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 2011 transitions. [2022-07-13 23:23:01,072 INFO L496 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) [2022-07-13 23:23:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2011 transitions. [2022-07-13 23:23:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-13 23:23:01,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:23:01,074 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:23:01,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 23:23:01,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 23:23:01,295 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:23:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:23:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1741248058, now seen corresponding path program 1 times [2022-07-13 23:23:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:23:01,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528975973] [2022-07-13 23:23:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:23:01,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:23:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:23:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:23:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:23:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:23:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:23:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:23:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:23:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:23:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:23:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:23:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:23:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:23:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:23:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:23:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:23:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 23:23:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-13 23:23:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:23:01,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528975973] [2022-07-13 23:23:01,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528975973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:23:01,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:23:01,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:23:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990563586] [2022-07-13 23:23:01,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:23:01,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:23:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:23:01,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:23:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:23:01,478 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) [2022-07-13 23:23:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:23:02,361 INFO L93 Difference]: Finished difference Result 2373 states and 3203 transitions. [2022-07-13 23:23:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 23:23:02,361 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 [2022-07-13 23:23:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:23:02,366 INFO L225 Difference]: With dead ends: 2373 [2022-07-13 23:23:02,366 INFO L226 Difference]: Without dead ends: 1220 [2022-07-13 23:23:02,368 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:23:02,369 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 439 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:23:02,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1408 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:23:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-07-13 23:23:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1128. [2022-07-13 23:23:02,421 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) [2022-07-13 23:23:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1489 transitions. [2022-07-13 23:23:02,424 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1489 transitions. Word has length 198 [2022-07-13 23:23:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:23:02,424 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 1489 transitions. [2022-07-13 23:23:02,425 INFO L496 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) [2022-07-13 23:23:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1489 transitions. [2022-07-13 23:23:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-13 23:23:02,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:23:02,427 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:23:02,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 23:23:02,428 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:23:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:23:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash -829148697, now seen corresponding path program 1 times [2022-07-13 23:23:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:23:02,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312546807] [2022-07-13 23:23:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:23:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:23:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:23:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:23:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:23:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:23:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:23:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:23:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:23:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:23:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:23:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:23:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:23:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:23:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:23:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:23:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:23:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 23:23:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 23:23:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-13 23:23:02,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:23:02,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312546807] [2022-07-13 23:23:02,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312546807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:23:02,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:23:02,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:23:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578187819] [2022-07-13 23:23:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:23:02,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:23:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:23:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:23:02,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:23:02,652 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) [2022-07-13 23:23:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:23:03,576 INFO L93 Difference]: Finished difference Result 3214 states and 4411 transitions. [2022-07-13 23:23:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:23:03,577 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 [2022-07-13 23:23:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:23:03,583 INFO L225 Difference]: With dead ends: 3214 [2022-07-13 23:23:03,584 INFO L226 Difference]: Without dead ends: 2094 [2022-07-13 23:23:03,586 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:23:03,587 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 491 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:23:03,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1689 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:23:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-07-13 23:23:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1134. [2022-07-13 23:23:03,662 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) [2022-07-13 23:23:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1495 transitions. [2022-07-13 23:23:03,664 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1495 transitions. Word has length 220 [2022-07-13 23:23:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:23:03,665 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 1495 transitions. [2022-07-13 23:23:03,665 INFO L496 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) [2022-07-13 23:23:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1495 transitions. [2022-07-13 23:23:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-07-13 23:23:03,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:23:03,669 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:23:03,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 23:23:03,669 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:23:03,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:23:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1357206825, now seen corresponding path program 1 times [2022-07-13 23:23:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:23:03,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176624363] [2022-07-13 23:23:03,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:23:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:23:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:23:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:23:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:23:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:23:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:23:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:23:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:23:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:23:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:23:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:23:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:23:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:23:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:23:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:23:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:23:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:23:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-13 23:23:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 23:23:03,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:23:03,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176624363] [2022-07-13 23:23:03,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176624363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:23:03,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:23:03,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:23:03,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074117591] [2022-07-13 23:23:03,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:23:03,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:23:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:23:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:23:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:23:03,924 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) [2022-07-13 23:23:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:23:04,589 INFO L93 Difference]: Finished difference Result 2163 states and 2861 transitions. [2022-07-13 23:23:04,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 23:23:04,589 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 [2022-07-13 23:23:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:23:04,593 INFO L225 Difference]: With dead ends: 2163 [2022-07-13 23:23:04,593 INFO L226 Difference]: Without dead ends: 1037 [2022-07-13 23:23:04,595 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:23:04,596 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 529 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:23:04,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 850 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 23:23:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-07-13 23:23:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 947. [2022-07-13 23:23:04,649 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) [2022-07-13 23:23:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1232 transitions. [2022-07-13 23:23:04,651 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1232 transitions. Word has length 236 [2022-07-13 23:23:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:23:04,651 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1232 transitions. [2022-07-13 23:23:04,652 INFO L496 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) [2022-07-13 23:23:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1232 transitions. [2022-07-13 23:23:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-07-13 23:23:04,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:23:04,654 INFO L195 NwaCegarLoop]: 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] [2022-07-13 23:23:04,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 23:23:04,655 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:23:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:23:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash 533574185, now seen corresponding path program 2 times [2022-07-13 23:23:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:23:04,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717299404] [2022-07-13 23:23:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:23:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:23:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:23:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:23:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:23:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:23:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:23:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:23:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:23:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 23:23:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:23:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:23:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:23:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:23:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:23:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:23:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:23:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 23:23:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-13 23:23:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:23:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:23:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-13 23:23:04,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:23:04,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717299404] [2022-07-13 23:23:04,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717299404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:23:04,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:23:04,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:23:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701559932] [2022-07-13 23:23:04,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:23:04,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:23:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:23:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:23:04,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:23:04,941 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) [2022-07-13 23:23:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:23:05,784 INFO L93 Difference]: Finished difference Result 1373 states and 1820 transitions. [2022-07-13 23:23:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 23:23:05,786 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 [2022-07-13 23:23:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:23:05,796 INFO L225 Difference]: With dead ends: 1373 [2022-07-13 23:23:05,796 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 23:23:05,805 INFO L412 NwaCegarLoop]: 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 [2022-07-13 23:23:05,805 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 863 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:23:05,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 874 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 23:23:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 23:23:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 23:23:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 23:23:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 23:23:05,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2022-07-13 23:23:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:23:05,806 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 23:23:05,807 INFO L496 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) [2022-07-13 23:23:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 23:23:05,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 23:23:05,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 23:23:05,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 23:23:05,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 23:25:43,461 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2022-07-13 23:25:43,462 INFO L895 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))) [2022-07-13 23:25:43,463 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 2594 2596) no Hoare annotation was computed. [2022-07-13 23:25:43,463 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2022-07-13 23:25:43,482 INFO L902 garLoopResultBuilder]: At program point ipmi_destroy_userENTRY(lines 2553 2555) the Hoare annotation is: true [2022-07-13 23:25:43,483 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userFINAL(lines 2553 2555) no Hoare annotation was computed. [2022-07-13 23:25:43,483 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeFINAL(lines 2470 2484) no Hoare annotation was computed. [2022-07-13 23:25:43,483 INFO L895 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))))) [2022-07-13 23:25:43,483 INFO L899 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2022-07-13 23:25:43,483 INFO L899 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2022-07-13 23:25:43,484 INFO L895 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)))) [2022-07-13 23:25:43,485 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2022-07-13 23:25:43,485 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2022-07-13 23:25:43,485 INFO L902 garLoopResultBuilder]: At program point wait_for_completionENTRY(lines 2590 2592) the Hoare annotation is: true [2022-07-13 23:25:43,485 INFO L899 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2022-07-13 23:25:43,485 INFO L899 garLoopResultBuilder]: For program point wait_for_completionFINAL(lines 2590 2592) no Hoare annotation was computed. [2022-07-13 23:25:43,485 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 2545 2547) no Hoare annotation was computed. [2022-07-13 23:25:43,485 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 2545 2547) the Hoare annotation is: true [2022-07-13 23:25:43,485 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2022-07-13 23:25:43,486 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2412 2417) no Hoare annotation was computed. [2022-07-13 23:25:43,486 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2412 2417) the Hoare annotation is: true [2022-07-13 23:25:43,486 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2022-07-13 23:25:43,486 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2022-07-13 23:25:43,486 INFO L895 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))) [2022-07-13 23:25:43,486 INFO L899 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2022-07-13 23:25:43,486 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2022-07-13 23:25:43,486 INFO L895 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))) [2022-07-13 23:25:43,487 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 1658 1665) no Hoare annotation was computed. [2022-07-13 23:25:43,487 INFO L895 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))) [2022-07-13 23:25:43,487 INFO L895 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))) [2022-07-13 23:25:43,487 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2022-07-13 23:25:43,487 INFO L902 garLoopResultBuilder]: At program point L1646-2(lines 1644 1647) the Hoare annotation is: true [2022-07-13 23:25:43,487 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 1649 1656) no Hoare annotation was computed. [2022-07-13 23:25:43,488 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2022-07-13 23:25:43,488 INFO L902 garLoopResultBuilder]: At program point L1567(lines 1564 1569) the Hoare annotation is: true [2022-07-13 23:25:43,488 INFO L902 garLoopResultBuilder]: At program point L1583(lines 1578 1585) the Hoare annotation is: true [2022-07-13 23:25:43,488 INFO L899 garLoopResultBuilder]: For program point extract_valueFINAL(lines 1676 1683) no Hoare annotation was computed. [2022-07-13 23:25:43,488 INFO L899 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2022-07-13 23:25:43,488 INFO L902 garLoopResultBuilder]: At program point L1575(lines 1570 1577) the Hoare annotation is: true [2022-07-13 23:25:43,488 INFO L902 garLoopResultBuilder]: At program point extract_valueENTRY(lines 1676 1683) the Hoare annotation is: true [2022-07-13 23:25:43,488 INFO L899 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2022-07-13 23:25:43,488 INFO L902 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2022-07-13 23:25:43,489 INFO L895 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-13 23:25:43,489 INFO L902 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2022-07-13 23:25:43,489 INFO L902 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2022-07-13 23:25:43,489 INFO L899 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2022-07-13 23:25:43,489 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2022-07-13 23:25:43,492 INFO L899 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2022-07-13 23:25:43,492 INFO L902 garLoopResultBuilder]: At program point L2226(lines 2201 2236) the Hoare annotation is: true [2022-07-13 23:25:43,492 INFO L902 garLoopResultBuilder]: At program point L2224(lines 2201 2236) the Hoare annotation is: true [2022-07-13 23:25:43,492 INFO L902 garLoopResultBuilder]: At program point L2220(lines 2201 2236) the Hoare annotation is: true [2022-07-13 23:25:43,492 INFO L902 garLoopResultBuilder]: At program point L2218(lines 2201 2236) the Hoare annotation is: true [2022-07-13 23:25:43,493 INFO L902 garLoopResultBuilder]: At program point L2216(lines 2201 2236) the Hoare annotation is: true [2022-07-13 23:25:43,493 INFO L902 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2022-07-13 23:25:43,494 INFO L899 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2022-07-13 23:25:43,494 INFO L899 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2022-07-13 23:25:43,495 INFO L895 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-13 23:25:43,495 INFO L899 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2022-07-13 23:25:43,495 INFO L899 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2022-07-13 23:25:43,495 INFO L902 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2022-07-13 23:25:43,495 INFO L902 garLoopResultBuilder]: At program point L2582(lines 2581 2583) the Hoare annotation is: true [2022-07-13 23:25:43,495 INFO L899 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2022-07-13 23:25:43,495 INFO L902 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2022-07-13 23:25:43,495 INFO L899 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2022-07-13 23:25:43,495 INFO L895 garLoopResultBuilder]: At program point ibmpex_bmc_deleteENTRY(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-13 23:25:43,496 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2022-07-13 23:25:43,496 INFO L899 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2022-07-13 23:25:43,496 INFO L902 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2022-07-13 23:25:43,496 INFO L899 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2022-07-13 23:25:43,496 INFO L902 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2022-07-13 23:25:43,496 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2022-07-13 23:25:43,496 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 2424 2429) the Hoare annotation is: true [2022-07-13 23:25:43,496 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 2424 2429) no Hoare annotation was computed. [2022-07-13 23:25:43,496 INFO L902 garLoopResultBuilder]: At program point ipmi_free_recv_msgENTRY(lines 2556 2558) the Hoare annotation is: true [2022-07-13 23:25:43,496 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2022-07-13 23:25:43,497 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgFINAL(lines 2556 2558) no Hoare annotation was computed. [2022-07-13 23:25:43,497 INFO L895 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))) [2022-07-13 23:25:43,497 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2022-07-13 23:25:43,497 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2022-07-13 23:25:43,497 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2022-07-13 23:25:43,497 INFO L902 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2022-07-13 23:25:43,497 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2022-07-13 23:25:43,497 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2022-07-13 23:25:43,498 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2022-07-13 23:25:43,498 INFO L902 garLoopResultBuilder]: At program point L2561(lines 2560 2562) the Hoare annotation is: true [2022-07-13 23:25:43,498 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2022-07-13 23:25:43,498 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2022-07-13 23:25:43,498 INFO L895 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))))) [2022-07-13 23:25:43,499 INFO L902 garLoopResultBuilder]: At program point L1708(lines 1698 1718) the Hoare annotation is: true [2022-07-13 23:25:43,499 INFO L899 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2022-07-13 23:25:43,499 INFO L895 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))))) [2022-07-13 23:25:43,499 INFO L895 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))))) [2022-07-13 23:25:43,499 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2022-07-13 23:25:43,499 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2022-07-13 23:25:43,499 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 2539 2541) the Hoare annotation is: true [2022-07-13 23:25:43,499 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 2539 2541) no Hoare annotation was computed. [2022-07-13 23:25:43,499 INFO L899 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2022-07-13 23:25:43,500 INFO L895 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))) [2022-07-13 23:25:43,500 INFO L895 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))) [2022-07-13 23:25:43,500 INFO L899 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2022-07-13 23:25:43,500 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2022-07-13 23:25:43,500 INFO L895 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))) [2022-07-13 23:25:43,500 INFO L902 garLoopResultBuilder]: At program point L2316(lines 2302 2320) the Hoare annotation is: true [2022-07-13 23:25:43,500 INFO L899 garLoopResultBuilder]: For program point L2349(lines 2349 2364) no Hoare annotation was computed. [2022-07-13 23:25:43,510 INFO L895 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))) [2022-07-13 23:25:43,510 INFO L895 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))) [2022-07-13 23:25:43,512 INFO L895 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))) [2022-07-13 23:25:43,512 INFO L899 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2022-07-13 23:25:43,512 INFO L899 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2022-07-13 23:25:43,512 INFO L899 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2022-07-13 23:25:43,512 INFO L895 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))) [2022-07-13 23:25:43,512 INFO L895 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))) [2022-07-13 23:25:43,512 INFO L899 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2022-07-13 23:25:43,512 INFO L895 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))) [2022-07-13 23:25:43,513 INFO L899 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2022-07-13 23:25:43,513 INFO L895 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))) [2022-07-13 23:25:43,513 INFO L899 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2022-07-13 23:25:43,513 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2022-07-13 23:25:43,513 INFO L895 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))) [2022-07-13 23:25:43,514 INFO L895 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))) [2022-07-13 23:25:43,514 INFO L902 garLoopResultBuilder]: At program point L2319(lines 2295 2321) the Hoare annotation is: true [2022-07-13 23:25:43,514 INFO L899 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2022-07-13 23:25:43,514 INFO L895 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))) [2022-07-13 23:25:43,514 INFO L899 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2022-07-13 23:25:43,515 INFO L895 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))) [2022-07-13 23:25:43,515 INFO L899 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2022-07-13 23:25:43,515 INFO L895 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))) [2022-07-13 23:25:43,515 INFO L899 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2022-07-13 23:25:43,515 INFO L899 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2022-07-13 23:25:43,515 INFO L895 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))) [2022-07-13 23:25:43,515 INFO L899 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2022-07-13 23:25:43,515 INFO L899 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2022-07-13 23:25:43,516 INFO L899 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2022-07-13 23:25:43,516 INFO L899 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2022-07-13 23:25:43,516 INFO L895 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))) [2022-07-13 23:25:43,516 INFO L899 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2022-07-13 23:25:43,516 INFO L895 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))) [2022-07-13 23:25:43,516 INFO L899 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2022-07-13 23:25:43,516 INFO L895 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))) [2022-07-13 23:25:43,516 INFO L895 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))) [2022-07-13 23:25:43,517 INFO L895 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))) [2022-07-13 23:25:43,517 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2022-07-13 23:25:43,517 INFO L899 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2022-07-13 23:25:43,517 INFO L895 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))) [2022-07-13 23:25:43,517 INFO L899 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2022-07-13 23:25:43,517 INFO L899 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2022-07-13 23:25:43,517 INFO L899 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2022-07-13 23:25:43,517 INFO L899 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2022-07-13 23:25:43,517 INFO L895 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))) [2022-07-13 23:25:43,518 INFO L895 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))) [2022-07-13 23:25:43,518 INFO L899 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2022-07-13 23:25:43,518 INFO L899 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2022-07-13 23:25:43,518 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2022-07-13 23:25:43,518 INFO L895 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))) [2022-07-13 23:25:43,518 INFO L899 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2022-07-13 23:25:43,518 INFO L899 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2022-07-13 23:25:43,518 INFO L899 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2022-07-13 23:25:43,518 INFO L895 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)) [2022-07-13 23:25:43,519 INFO L899 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2022-07-13 23:25:43,519 INFO L899 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2022-07-13 23:25:43,519 INFO L899 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2022-07-13 23:25:43,519 INFO L895 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))) [2022-07-13 23:25:43,519 INFO L899 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2022-07-13 23:25:43,519 INFO L895 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))) [2022-07-13 23:25:43,519 INFO L895 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))) [2022-07-13 23:25:43,519 INFO L895 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))) [2022-07-13 23:25:43,519 INFO L899 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2022-07-13 23:25:43,520 INFO L895 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))) [2022-07-13 23:25:43,520 INFO L895 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))) [2022-07-13 23:25:43,520 INFO L895 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))) [2022-07-13 23:25:43,520 INFO L895 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))) [2022-07-13 23:25:43,520 INFO L899 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2022-07-13 23:25:43,520 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2022-07-13 23:25:43,520 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2022-07-13 23:25:43,520 INFO L895 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))) [2022-07-13 23:25:43,521 INFO L895 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))) [2022-07-13 23:25:43,521 INFO L895 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))) [2022-07-13 23:25:43,521 INFO L899 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2022-07-13 23:25:43,521 INFO L895 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2022-07-13 23:25:43,521 INFO L895 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))) [2022-07-13 23:25:43,521 INFO L899 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2022-07-13 23:25:43,521 INFO L895 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))) [2022-07-13 23:25:43,521 INFO L895 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))) [2022-07-13 23:25:43,522 INFO L899 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2022-07-13 23:25:43,522 INFO L895 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))) [2022-07-13 23:25:43,522 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2022-07-13 23:25:43,522 INFO L895 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))) [2022-07-13 23:25:43,522 INFO L899 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2022-07-13 23:25:43,522 INFO L895 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))) [2022-07-13 23:25:43,522 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 23:25:43,522 INFO L895 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))) [2022-07-13 23:25:43,523 INFO L899 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2022-07-13 23:25:43,523 INFO L895 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))) [2022-07-13 23:25:43,523 INFO L899 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2022-07-13 23:25:43,523 INFO L899 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2022-07-13 23:25:43,523 INFO L895 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))) [2022-07-13 23:25:43,523 INFO L895 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))) [2022-07-13 23:25:43,523 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2022-07-13 23:25:43,523 INFO L895 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))) [2022-07-13 23:25:43,524 INFO L899 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2022-07-13 23:25:43,524 INFO L895 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))) [2022-07-13 23:25:43,524 INFO L895 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)) [2022-07-13 23:25:43,532 INFO L895 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)))) [2022-07-13 23:25:43,533 INFO L895 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))) [2022-07-13 23:25:43,533 INFO L899 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2022-07-13 23:25:43,533 INFO L899 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2022-07-13 23:25:43,533 INFO L899 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2022-07-13 23:25:43,533 INFO L899 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2022-07-13 23:25:43,533 INFO L895 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))) [2022-07-13 23:25:43,533 INFO L899 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2022-07-13 23:25:43,533 INFO L895 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))) [2022-07-13 23:25:43,534 INFO L895 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))) [2022-07-13 23:25:43,534 INFO L895 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))) [2022-07-13 23:25:43,534 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 23:25:43,534 INFO L899 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2022-07-13 23:25:43,534 INFO L899 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2022-07-13 23:25:43,534 INFO L895 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))) [2022-07-13 23:25:43,534 INFO L899 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2022-07-13 23:25:43,534 INFO L902 garLoopResultBuilder]: At program point L2569(lines 2568 2570) the Hoare annotation is: true [2022-07-13 23:25:43,535 INFO L902 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2022-07-13 23:25:43,535 INFO L899 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2022-07-13 23:25:43,535 INFO L899 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2022-07-13 23:25:43,535 INFO L899 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2022-07-13 23:25:43,535 INFO L895 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))) [2022-07-13 23:25:43,535 INFO L895 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)) [2022-07-13 23:25:43,535 INFO L899 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2022-07-13 23:25:43,535 INFO L899 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2022-07-13 23:25:43,535 INFO L895 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))) [2022-07-13 23:25:43,536 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 23:25:43,536 INFO L895 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)))) [2022-07-13 23:25:43,536 INFO L899 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2022-07-13 23:25:43,536 INFO L895 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))) [2022-07-13 23:25:43,536 INFO L899 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2022-07-13 23:25:43,536 INFO L899 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2022-07-13 23:25:43,536 INFO L902 garLoopResultBuilder]: At program point L2374(lines 2337 2377) the Hoare annotation is: true [2022-07-13 23:25:43,536 INFO L895 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))) [2022-07-13 23:25:43,537 INFO L895 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)))) [2022-07-13 23:25:43,537 INFO L895 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))) [2022-07-13 23:25:43,537 INFO L899 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2022-07-13 23:25:43,537 INFO L895 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))) [2022-07-13 23:25:43,537 INFO L899 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2022-07-13 23:25:43,538 INFO L895 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)))) [2022-07-13 23:25:43,538 INFO L899 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2022-07-13 23:25:43,538 INFO L899 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2022-07-13 23:25:43,538 INFO L902 garLoopResultBuilder]: At program point L2376(lines 2327 2378) the Hoare annotation is: true [2022-07-13 23:25:43,538 INFO L899 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2022-07-13 23:25:43,538 INFO L895 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))) [2022-07-13 23:25:43,539 INFO L895 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))) [2022-07-13 23:25:43,539 INFO L899 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2022-07-13 23:25:43,539 INFO L899 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2022-07-13 23:25:43,539 INFO L899 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2022-07-13 23:25:43,539 INFO L899 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2022-07-13 23:25:43,539 INFO L895 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))) [2022-07-13 23:25:43,539 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 23:25:43,539 INFO L895 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))) [2022-07-13 23:25:43,540 INFO L895 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))) [2022-07-13 23:25:43,540 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-07-13 23:25:43,541 INFO L902 garLoopResultBuilder]: At program point L2576(lines 2575 2577) the Hoare annotation is: true [2022-07-13 23:25:43,541 INFO L895 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)) [2022-07-13 23:25:43,541 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-13 23:25:43,541 INFO L895 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))) [2022-07-13 23:25:43,541 INFO L895 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))) [2022-07-13 23:25:43,541 INFO L895 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))) [2022-07-13 23:25:43,542 INFO L895 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))) [2022-07-13 23:25:43,542 INFO L899 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2022-07-13 23:25:43,542 INFO L899 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2022-07-13 23:25:43,542 INFO L895 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)))) [2022-07-13 23:25:43,542 INFO L899 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2022-07-13 23:25:43,542 INFO L895 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))) [2022-07-13 23:25:43,542 INFO L902 garLoopResultBuilder]: At program point L2314(lines 2302 2320) the Hoare annotation is: true [2022-07-13 23:25:43,542 INFO L895 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))) [2022-07-13 23:25:43,543 INFO L895 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))) [2022-07-13 23:25:43,543 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 2536 2538) no Hoare annotation was computed. [2022-07-13 23:25:43,543 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2022-07-13 23:25:43,543 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 2536 2538) the Hoare annotation is: true [2022-07-13 23:25:43,545 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:25:43,561 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 23:25:43,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:25:43 BoogieIcfgContainer [2022-07-13 23:25:43,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 23:25:43,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 23:25:43,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 23:25:43,606 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 23:25:43,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:22:47" (3/4) ... [2022-07-13 23:25:43,609 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2022-07-13 23:25:43,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-13 23:25:43,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-07-13 23:25:43,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-07-13 23:25:43,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-07-13 23:25:43,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2022-07-13 23:25:43,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2022-07-13 23:25:43,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-07-13 23:25:43,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 144 nodes and edges [2022-07-13 23:25:43,630 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2022-07-13 23:25:43,631 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-13 23:25:43,632 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-13 23:25:43,633 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 23:25:43,634 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 23:25:43,661 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) [2022-07-13 23:25:43,663 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)) [2022-07-13 23:25:43,663 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)) [2022-07-13 23:25:43,728 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 23:25:43,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 23:25:43,728 INFO L158 Benchmark]: Toolchain (without parser) took 178234.18ms. Allocated memory was 102.8MB in the beginning and 922.7MB in the end (delta: 820.0MB). Free memory was 67.9MB in the beginning and 532.4MB in the end (delta: -464.5MB). Peak memory consumption was 356.3MB. Max. memory is 16.1GB. [2022-07-13 23:25:43,729 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 23:25:43,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 971.39ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 41.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-13 23:25:43,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.69ms. Allocated memory was 102.8MB in the beginning and 146.8MB in the end (delta: 44.0MB). Free memory was 41.7MB in the beginning and 116.1MB in the end (delta: -74.5MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-07-13 23:25:43,730 INFO L158 Benchmark]: Boogie Preprocessor took 65.17ms. Allocated memory is still 146.8MB. Free memory was 116.1MB in the beginning and 109.0MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 23:25:43,730 INFO L158 Benchmark]: RCFGBuilder took 992.19ms. Allocated memory is still 146.8MB. Free memory was 109.0MB in the beginning and 85.4MB in the end (delta: 23.7MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2022-07-13 23:25:43,730 INFO L158 Benchmark]: TraceAbstraction took 175969.29ms. Allocated memory was 146.8MB in the beginning and 922.7MB in the end (delta: 775.9MB). Free memory was 84.2MB in the beginning and 549.4MB in the end (delta: -465.2MB). Peak memory consumption was 548.6MB. Max. memory is 16.1GB. [2022-07-13 23:25:43,730 INFO L158 Benchmark]: Witness Printer took 121.91ms. Allocated memory is still 922.7MB. Free memory was 549.4MB in the beginning and 532.4MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 23:25:43,734 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.19ms. Allocated memory is still 102.8MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 971.39ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 41.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.69ms. Allocated memory was 102.8MB in the beginning and 146.8MB in the end (delta: 44.0MB). Free memory was 41.7MB in the beginning and 116.1MB in the end (delta: -74.5MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.17ms. Allocated memory is still 146.8MB. Free memory was 116.1MB in the beginning and 109.0MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 992.19ms. Allocated memory is still 146.8MB. Free memory was 109.0MB in the beginning and 85.4MB in the end (delta: 23.7MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 175969.29ms. Allocated memory was 146.8MB in the beginning and 922.7MB in the end (delta: 775.9MB). Free memory was 84.2MB in the beginning and 549.4MB in the end (delta: -465.2MB). Peak memory consumption was 548.6MB. Max. memory is 16.1GB. * Witness Printer took 121.91ms. Allocated memory is still 922.7MB. Free memory was 549.4MB in the beginning and 532.4MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. 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: 175.9s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 157.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8336 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7712 mSDsluCounter, 20846 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13444 mSDsCounter, 2846 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8807 IncrementalHoareTripleChecker+Invalid, 11653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2846 mSolverCounterUnsat, 7402 mSDtfsCounter, 8807 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1234 GetRequests, 1133 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s 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.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 9153 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 3879 PreInvPairs, 4613 NumberOfFragments, 4151 HoareAnnotationTreeSize, 3879 FomulaSimplifications, 489212 FormulaSimplificationTreeSizeReduction, 138.6s HoareSimplificationTime, 134 FomulaSimplificationsInter, 2854068 FormulaSimplificationTreeSizeReductionInter, 18.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2976 NumberOfCodeBlocks, 2976 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3144 ConstructedInterpolants, 0 QuantifiedInterpolants, 5246 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3396 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 [2022-07-13 23:25:43,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,758 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 [2022-07-13 23:25:43,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 23:25:43,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 23:25:43,775 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! [2022-07-13 23:25:43,803 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