./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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP --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.3-dev-e7bb482 [2023-11-06 22:06:07,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:06:07,828 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:06:07,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:06:07,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:06:07,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:06:07,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:06:07,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:06:07,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:06:07,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:06:07,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:06:07,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:06:07,868 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:06:07,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:06:07,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:06:07,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:06:07,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:06:07,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:06:07,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:06:07,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:06:07,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:06:07,883 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:06:07,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:06:07,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:06:07,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:06:07,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:07,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:06:07,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:06:07,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:06:07,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:06:07,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:06:07,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:06:07,888 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:06:07,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:06:07,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:06:07,889 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:06:07,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP 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 [2023-11-06 22:06:08,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:06:08,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:06:08,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:06:08,256 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:06:08,257 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:06:08,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-06 22:06:11,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:06:12,225 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:06:12,226 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-06 22:06:12,258 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/data/318b7ea7f/6633556d73724cb281b51a7b35b846f9/FLAG0f12e58b0 [2023-11-06 22:06:12,280 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/data/318b7ea7f/6633556d73724cb281b51a7b35b846f9 [2023-11-06 22:06:12,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:06:12,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:06:12,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:12,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:06:12,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:06:12,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:12" (1/1) ... [2023-11-06 22:06:12,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e4f732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:12, skipping insertion in model container [2023-11-06 22:06:12,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:12" (1/1) ... [2023-11-06 22:06:12,423 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:06:13,369 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2023-11-06 22:06:13,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:13,446 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:06:13,626 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2023-11-06 22:06:13,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:13,689 WARN L672 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:06:13,689 WARN L672 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:06:13,700 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:06:13,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13 WrapperNode [2023-11-06 22:06:13,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:13,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:13,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:06:13,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:06:13,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:13,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:13,890 INFO L138 Inliner]: procedures = 102, calls = 434, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1146 [2023-11-06 22:06:13,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:13,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:06:13,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:06:13,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:06:13,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:13,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:13,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:13,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:13,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:13,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:14,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:14,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:14,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:06:14,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:06:14,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:06:14,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:06:14,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (1/1) ... [2023-11-06 22:06:14,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:14,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:14,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:06:14,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:06:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-06 22:06:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-06 22:06:14,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-06 22:06:14,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:06:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-06 22:06:14,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-06 22:06:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-06 22:06:14,144 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-06 22:06:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:06:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-06 22:06:14,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-06 22:06:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2023-11-06 22:06:14,145 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2023-11-06 22:06:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:06:14,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:06:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2023-11-06 22:06:14,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2023-11-06 22:06:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:06:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2023-11-06 22:06:14,150 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2023-11-06 22:06:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:06:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-06 22:06:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-06 22:06:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2023-11-06 22:06:14,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2023-11-06 22:06:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:06:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-06 22:06:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-06 22:06:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2023-11-06 22:06:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2023-11-06 22:06:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-06 22:06:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-06 22:06:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:06:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:06:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-06 22:06:14,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-06 22:06:14,156 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2023-11-06 22:06:14,156 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2023-11-06 22:06:14,156 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-06 22:06:14,157 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-06 22:06:14,157 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-06 22:06:14,157 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-06 22:06:14,157 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-06 22:06:14,157 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-06 22:06:14,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:06:14,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2023-11-06 22:06:14,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2023-11-06 22:06:14,158 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2023-11-06 22:06:14,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2023-11-06 22:06:14,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-06 22:06:14,159 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2023-11-06 22:06:14,159 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2023-11-06 22:06:14,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:06:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:06:14,576 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:06:14,579 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:06:16,251 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:06:16,263 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:06:16,263 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:06:16,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:16 BoogieIcfgContainer [2023-11-06 22:06:16,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:06:16,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:06:16,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:06:16,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:06:16,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:06:12" (1/3) ... [2023-11-06 22:06:16,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5e80a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:16, skipping insertion in model container [2023-11-06 22:06:16,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:13" (2/3) ... [2023-11-06 22:06:16,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5e80a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:16, skipping insertion in model container [2023-11-06 22:06:16,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:16" (3/3) ... [2023-11-06 22:06:16,277 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-06 22:06:16,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:06:16,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:06:16,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:06:16,403 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ade837d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:06:16,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:06:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 229 states have internal predecessors, (290), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 22:06:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:06:16,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:16,442 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] [2023-11-06 22:06:16,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:16,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash -888730242, now seen corresponding path program 1 times [2023-11-06 22:06:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985474392] [2023-11-06 22:06:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:06:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:06:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:06:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:06:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:06:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:06:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 22:06:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985474392] [2023-11-06 22:06:17,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985474392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:17,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:17,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155709340] [2023-11-06 22:06:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:17,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:17,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:17,781 INFO L87 Difference]: Start difference. First operand has 298 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 229 states have internal predecessors, (290), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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) [2023-11-06 22:06:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:19,782 INFO L93 Difference]: Finished difference Result 685 states and 939 transitions. [2023-11-06 22:06:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 126 [2023-11-06 22:06:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:19,804 INFO L225 Difference]: With dead ends: 685 [2023-11-06 22:06:19,804 INFO L226 Difference]: Without dead ends: 371 [2023-11-06 22:06:19,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:19,817 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 262 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:19,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1336 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:06:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-11-06 22:06:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 286. [2023-11-06 22:06:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 216 states have (on average 1.2777777777777777) internal successors, (276), 219 states have internal predecessors, (276), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-06 22:06:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 378 transitions. [2023-11-06 22:06:19,915 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 378 transitions. Word has length 126 [2023-11-06 22:06:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:19,916 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 378 transitions. [2023-11-06 22:06:19,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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) [2023-11-06 22:06:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 378 transitions. [2023-11-06 22:06:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:06:19,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:19,924 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] [2023-11-06 22:06:19,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:06:19,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:19,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash -672722115, now seen corresponding path program 1 times [2023-11-06 22:06:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170308641] [2023-11-06 22:06:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 22:06:20,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170308641] [2023-11-06 22:06:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170308641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:20,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:06:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082189191] [2023-11-06 22:06:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:20,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:20,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:20,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:20,525 INFO L87 Difference]: Start difference. First operand 286 states and 378 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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) [2023-11-06 22:06:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:21,647 INFO L93 Difference]: Finished difference Result 594 states and 792 transitions. [2023-11-06 22:06:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:06:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 137 [2023-11-06 22:06:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:21,653 INFO L225 Difference]: With dead ends: 594 [2023-11-06 22:06:21,653 INFO L226 Difference]: Without dead ends: 316 [2023-11-06 22:06:21,655 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 [2023-11-06 22:06:21,657 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 189 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:21,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 787 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:06:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-06 22:06:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 287. [2023-11-06 22:06:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 217 states have (on average 1.2764976958525345) internal successors, (277), 220 states have internal predecessors, (277), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-06 22:06:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 379 transitions. [2023-11-06 22:06:21,702 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 379 transitions. Word has length 137 [2023-11-06 22:06:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:21,703 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 379 transitions. [2023-11-06 22:06:21,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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) [2023-11-06 22:06:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 379 transitions. [2023-11-06 22:06:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:06:21,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:21,708 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] [2023-11-06 22:06:21,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:06:21,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:21,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1730560193, now seen corresponding path program 1 times [2023-11-06 22:06:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:21,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932228184] [2023-11-06 22:06:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 22:06:22,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932228184] [2023-11-06 22:06:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932228184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:22,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:22,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365172300] [2023-11-06 22:06:22,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:22,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:22,260 INFO L87 Difference]: Start difference. First operand 287 states and 379 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2023-11-06 22:06:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:23,679 INFO L93 Difference]: Finished difference Result 684 states and 925 transitions. [2023-11-06 22:06:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 137 [2023-11-06 22:06:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:23,686 INFO L225 Difference]: With dead ends: 684 [2023-11-06 22:06:23,686 INFO L226 Difference]: Without dead ends: 405 [2023-11-06 22:06:23,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:23,692 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 273 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:23,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1359 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:06:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-11-06 22:06:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 289. [2023-11-06 22:06:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 219 states have (on average 1.273972602739726) internal successors, (279), 222 states have internal predecessors, (279), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-06 22:06:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 381 transitions. [2023-11-06 22:06:23,750 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 381 transitions. Word has length 137 [2023-11-06 22:06:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:23,753 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 381 transitions. [2023-11-06 22:06:23,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2023-11-06 22:06:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 381 transitions. [2023-11-06 22:06:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:06:23,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:23,763 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] [2023-11-06 22:06:23,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:06:23,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:23,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1707927939, now seen corresponding path program 1 times [2023-11-06 22:06:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:23,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835928471] [2023-11-06 22:06:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 22:06:24,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:24,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835928471] [2023-11-06 22:06:24,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835928471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:24,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:24,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:06:24,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589005330] [2023-11-06 22:06:24,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:24,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:24,176 INFO L87 Difference]: Start difference. First operand 289 states and 381 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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) [2023-11-06 22:06:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:25,080 INFO L93 Difference]: Finished difference Result 600 states and 798 transitions. [2023-11-06 22:06:25,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:06:25,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 137 [2023-11-06 22:06:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:25,084 INFO L225 Difference]: With dead ends: 600 [2023-11-06 22:06:25,085 INFO L226 Difference]: Without dead ends: 319 [2023-11-06 22:06:25,086 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 [2023-11-06 22:06:25,087 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 189 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:25,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 787 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:06:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-11-06 22:06:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 290. [2023-11-06 22:06:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 220 states have (on average 1.2727272727272727) internal successors, (280), 223 states have internal predecessors, (280), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-06 22:06:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 382 transitions. [2023-11-06 22:06:25,149 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 382 transitions. Word has length 137 [2023-11-06 22:06:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:25,152 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 382 transitions. [2023-11-06 22:06:25,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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) [2023-11-06 22:06:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 382 transitions. [2023-11-06 22:06:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:06:25,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:25,157 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] [2023-11-06 22:06:25,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:06:25,158 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:25,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1006328065, now seen corresponding path program 1 times [2023-11-06 22:06:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:25,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252165423] [2023-11-06 22:06:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 22:06:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:25,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252165423] [2023-11-06 22:06:25,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252165423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:25,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:25,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:25,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223502024] [2023-11-06 22:06:25,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:25,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:06:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:25,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:06:25,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:25,985 INFO L87 Difference]: Start difference. First operand 290 states and 382 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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) [2023-11-06 22:06:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:28,071 INFO L93 Difference]: Finished difference Result 935 states and 1254 transitions. [2023-11-06 22:06:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:06:28,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 137 [2023-11-06 22:06:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:28,080 INFO L225 Difference]: With dead ends: 935 [2023-11-06 22:06:28,080 INFO L226 Difference]: Without dead ends: 931 [2023-11-06 22:06:28,081 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 [2023-11-06 22:06:28,082 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 1194 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:28,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1246 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:06:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2023-11-06 22:06:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 844. [2023-11-06 22:06:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 642 states have (on average 1.2741433021806854) internal successors, (818), 649 states have internal predecessors, (818), 150 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (152), 148 states have call predecessors, (152), 148 states have call successors, (152) [2023-11-06 22:06:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1120 transitions. [2023-11-06 22:06:28,186 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1120 transitions. Word has length 137 [2023-11-06 22:06:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:28,187 INFO L495 AbstractCegarLoop]: Abstraction has 844 states and 1120 transitions. [2023-11-06 22:06:28,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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) [2023-11-06 22:06:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1120 transitions. [2023-11-06 22:06:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-06 22:06:28,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:28,190 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, 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] [2023-11-06 22:06:28,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:06:28,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:28,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash -270008790, now seen corresponding path program 1 times [2023-11-06 22:06:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734815457] [2023-11-06 22:06:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:06:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 22:06:28,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734815457] [2023-11-06 22:06:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734815457] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428708006] [2023-11-06 22:06:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:28,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:28,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:28,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:28,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:06:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:29,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 1644 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:06:29,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 22:06:29,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:06:29,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428708006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:29,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:06:29,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-06 22:06:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148524151] [2023-11-06 22:06:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:29,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:06:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:29,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:06:29,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:29,383 INFO L87 Difference]: Start difference. First operand 844 states and 1120 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-06 22:06:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:29,529 INFO L93 Difference]: Finished difference Result 1682 states and 2235 transitions. [2023-11-06 22:06:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:06:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 147 [2023-11-06 22:06:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:29,540 INFO L225 Difference]: With dead ends: 1682 [2023-11-06 22:06:29,541 INFO L226 Difference]: Without dead ends: 1400 [2023-11-06 22:06:29,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:29,547 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 358 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1079 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 [2023-11-06 22:06:29,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1079 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:06:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-11-06 22:06:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1121. [2023-11-06 22:06:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 853 states have (on average 1.2731535756154748) internal successors, (1086), 862 states have internal predecessors, (1086), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-06 22:06:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1486 transitions. [2023-11-06 22:06:29,678 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1486 transitions. Word has length 147 [2023-11-06 22:06:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:29,680 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1486 transitions. [2023-11-06 22:06:29,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-06 22:06:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1486 transitions. [2023-11-06 22:06:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:06:29,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:29,685 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:29,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:29,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:29,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:29,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash 331201543, now seen corresponding path program 1 times [2023-11-06 22:06:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:29,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307269866] [2023-11-06 22:06:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:29,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 22:06:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 22:06:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:30,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307269866] [2023-11-06 22:06:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307269866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:30,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:30,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068786672] [2023-11-06 22:06:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:30,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:30,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:30,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:30,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:30,460 INFO L87 Difference]: Start difference. First operand 1121 states and 1486 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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) [2023-11-06 22:06:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:32,054 INFO L93 Difference]: Finished difference Result 2938 states and 4021 transitions. [2023-11-06 22:06:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:32,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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 192 [2023-11-06 22:06:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:32,073 INFO L225 Difference]: With dead ends: 2938 [2023-11-06 22:06:32,073 INFO L226 Difference]: Without dead ends: 1825 [2023-11-06 22:06:32,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 [2023-11-06 22:06:32,080 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 331 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:32,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1574 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:06:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2023-11-06 22:06:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1129. [2023-11-06 22:06:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 861 states have (on average 1.2706155632984901) internal successors, (1094), 870 states have internal predecessors, (1094), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-06 22:06:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1494 transitions. [2023-11-06 22:06:32,252 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1494 transitions. Word has length 192 [2023-11-06 22:06:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:32,253 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1494 transitions. [2023-11-06 22:06:32,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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) [2023-11-06 22:06:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1494 transitions. [2023-11-06 22:06:32,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:06:32,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:32,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:32,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:06:32,259 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:32,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:32,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1224687881, now seen corresponding path program 1 times [2023-11-06 22:06:32,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:32,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945426021] [2023-11-06 22:06:32,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:32,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 22:06:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 22:06:32,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:32,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945426021] [2023-11-06 22:06:32,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945426021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:32,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:32,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:06:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914589719] [2023-11-06 22:06:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:32,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:32,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:32,667 INFO L87 Difference]: Start difference. First operand 1129 states and 1494 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 3 states have internal predecessors, (112), 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) [2023-11-06 22:06:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:33,735 INFO L93 Difference]: Finished difference Result 2370 states and 3159 transitions. [2023-11-06 22:06:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:06:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 3 states have internal predecessors, (112), 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 192 [2023-11-06 22:06:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:33,745 INFO L225 Difference]: With dead ends: 2370 [2023-11-06 22:06:33,746 INFO L226 Difference]: Without dead ends: 1249 [2023-11-06 22:06:33,749 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 [2023-11-06 22:06:33,751 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 189 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:33,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 788 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:06:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-11-06 22:06:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1133. [2023-11-06 22:06:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 865 states have (on average 1.269364161849711) internal successors, (1098), 874 states have internal predecessors, (1098), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-06 22:06:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1498 transitions. [2023-11-06 22:06:33,870 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1498 transitions. Word has length 192 [2023-11-06 22:06:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:33,870 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1498 transitions. [2023-11-06 22:06:33,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 3 states have internal predecessors, (112), 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) [2023-11-06 22:06:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1498 transitions. [2023-11-06 22:06:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:06:33,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:33,875 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:33,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:06:33,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:33,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1142006713, now seen corresponding path program 1 times [2023-11-06 22:06:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:33,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792584487] [2023-11-06 22:06:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:33,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 22:06:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 22:06:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792584487] [2023-11-06 22:06:34,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792584487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:34,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:34,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051292976] [2023-11-06 22:06:34,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:34,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:34,459 INFO L87 Difference]: Start difference. First operand 1133 states and 1498 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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) [2023-11-06 22:06:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:36,258 INFO L93 Difference]: Finished difference Result 3478 states and 4819 transitions. [2023-11-06 22:06:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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 192 [2023-11-06 22:06:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:36,279 INFO L225 Difference]: With dead ends: 3478 [2023-11-06 22:06:36,279 INFO L226 Difference]: Without dead ends: 2353 [2023-11-06 22:06:36,283 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 [2023-11-06 22:06:36,286 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 520 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:36,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1745 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:06:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2023-11-06 22:06:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1141. [2023-11-06 22:06:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 873 states have (on average 1.2668957617411225) internal successors, (1106), 882 states have internal predecessors, (1106), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-06 22:06:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1506 transitions. [2023-11-06 22:06:36,464 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1506 transitions. Word has length 192 [2023-11-06 22:06:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:36,465 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 1506 transitions. [2023-11-06 22:06:36,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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) [2023-11-06 22:06:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1506 transitions. [2023-11-06 22:06:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-06 22:06:36,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:36,470 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:36,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:06:36,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:36,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:36,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1580965356, now seen corresponding path program 1 times [2023-11-06 22:06:36,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:36,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055706722] [2023-11-06 22:06:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:36,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:06:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 22:06:37,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055706722] [2023-11-06 22:06:37,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055706722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:37,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:37,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:37,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953728277] [2023-11-06 22:06:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:37,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:37,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:37,168 INFO L87 Difference]: Start difference. First operand 1141 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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) [2023-11-06 22:06:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:39,244 INFO L93 Difference]: Finished difference Result 3690 states and 5133 transitions. [2023-11-06 22:06:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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 193 [2023-11-06 22:06:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:39,269 INFO L225 Difference]: With dead ends: 3690 [2023-11-06 22:06:39,269 INFO L226 Difference]: Without dead ends: 2557 [2023-11-06 22:06:39,275 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 [2023-11-06 22:06:39,276 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 561 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:39,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 2016 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:06:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2023-11-06 22:06:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 1149. [2023-11-06 22:06:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 881 states have (on average 1.264472190692395) internal successors, (1114), 890 states have internal predecessors, (1114), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-06 22:06:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1514 transitions. [2023-11-06 22:06:39,523 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1514 transitions. Word has length 193 [2023-11-06 22:06:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:39,524 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1514 transitions. [2023-11-06 22:06:39,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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) [2023-11-06 22:06:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1514 transitions. [2023-11-06 22:06:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-06 22:06:39,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:39,530 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:39,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:06:39,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:39,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash -92508, now seen corresponding path program 1 times [2023-11-06 22:06:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:39,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949110088] [2023-11-06 22:06:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:06:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-06 22:06:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:40,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949110088] [2023-11-06 22:06:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949110088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:40,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320837103] [2023-11-06 22:06:40,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:40,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:40,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:40,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:40,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:40,139 INFO L87 Difference]: Start difference. First operand 1149 states and 1514 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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) [2023-11-06 22:06:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:41,782 INFO L93 Difference]: Finished difference Result 2746 states and 3691 transitions. [2023-11-06 22:06:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:41,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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 193 [2023-11-06 22:06:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:41,801 INFO L225 Difference]: With dead ends: 2746 [2023-11-06 22:06:41,801 INFO L226 Difference]: Without dead ends: 1605 [2023-11-06 22:06:41,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:41,807 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 281 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:41,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1347 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:06:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2023-11-06 22:06:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1228. [2023-11-06 22:06:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 952 states have (on average 1.2678571428571428) internal successors, (1207), 961 states have internal predecessors, (1207), 207 states have call successors, (207), 69 states have call predecessors, (207), 68 states have return successors, (209), 205 states have call predecessors, (209), 205 states have call successors, (209) [2023-11-06 22:06:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1623 transitions. [2023-11-06 22:06:41,993 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1623 transitions. Word has length 193 [2023-11-06 22:06:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:41,994 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 1623 transitions. [2023-11-06 22:06:41,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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) [2023-11-06 22:06:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1623 transitions. [2023-11-06 22:06:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-06 22:06:42,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:42,000 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:42,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:06:42,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:42,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash -688368932, now seen corresponding path program 1 times [2023-11-06 22:06:42,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:42,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081365061] [2023-11-06 22:06:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:06:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-06 22:06:42,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:42,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081365061] [2023-11-06 22:06:42,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081365061] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548304265] [2023-11-06 22:06:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:42,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:42,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:42,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:42,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:06:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:43,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:06:43,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-06 22:06:43,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-06 22:06:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548304265] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:43,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:06:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2023-11-06 22:06:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979674451] [2023-11-06 22:06:43,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:43,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:06:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:06:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:43,677 INFO L87 Difference]: Start difference. First operand 1228 states and 1623 transitions. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 6 states have internal predecessors, (151), 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) [2023-11-06 22:06:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:45,272 INFO L93 Difference]: Finished difference Result 3074 states and 4167 transitions. [2023-11-06 22:06:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:45,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 6 states have internal predecessors, (151), 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 194 [2023-11-06 22:06:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:45,289 INFO L225 Difference]: With dead ends: 3074 [2023-11-06 22:06:45,290 INFO L226 Difference]: Without dead ends: 1854 [2023-11-06 22:06:45,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:45,296 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 311 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:45,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1035 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:06:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2023-11-06 22:06:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1604. [2023-11-06 22:06:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1280 states have (on average 1.27421875) internal successors, (1631), 1289 states have internal predecessors, (1631), 255 states have call successors, (255), 69 states have call predecessors, (255), 68 states have return successors, (257), 253 states have call predecessors, (257), 253 states have call successors, (257) [2023-11-06 22:06:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2143 transitions. [2023-11-06 22:06:45,566 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2143 transitions. Word has length 194 [2023-11-06 22:06:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:45,567 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2143 transitions. [2023-11-06 22:06:45,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 6 states have internal predecessors, (151), 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) [2023-11-06 22:06:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2143 transitions. [2023-11-06 22:06:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-11-06 22:06:45,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:45,574 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:45,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:45,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:45,785 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:45,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1363498530, now seen corresponding path program 1 times [2023-11-06 22:06:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012561331] [2023-11-06 22:06:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:06:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-06 22:06:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-06 22:06:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:46,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012561331] [2023-11-06 22:06:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012561331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:46,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:46,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:06:46,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002158528] [2023-11-06 22:06:46,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:46,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:46,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:46,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:46,347 INFO L87 Difference]: Start difference. First operand 1604 states and 2143 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 3 states have internal predecessors, (116), 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) [2023-11-06 22:06:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:48,332 INFO L93 Difference]: Finished difference Result 2517 states and 3401 transitions. [2023-11-06 22:06:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:06:48,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 3 states have internal predecessors, (116), 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 206 [2023-11-06 22:06:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:48,345 INFO L225 Difference]: With dead ends: 2517 [2023-11-06 22:06:48,345 INFO L226 Difference]: Without dead ends: 1292 [2023-11-06 22:06:48,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:48,351 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 498 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:48,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1325 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:06:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2023-11-06 22:06:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1200. [2023-11-06 22:06:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 956 states have (on average 1.2594142259414225) internal successors, (1204), 963 states have internal predecessors, (1204), 192 states have call successors, (192), 52 states have call predecessors, (192), 51 states have return successors, (192), 190 states have call predecessors, (192), 190 states have call successors, (192) [2023-11-06 22:06:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1588 transitions. [2023-11-06 22:06:48,580 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1588 transitions. Word has length 206 [2023-11-06 22:06:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:48,581 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 1588 transitions. [2023-11-06 22:06:48,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 3 states have internal predecessors, (116), 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) [2023-11-06 22:06:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1588 transitions. [2023-11-06 22:06:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-11-06 22:06:48,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:48,590 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:48,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:06:48,591 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:48,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:48,591 INFO L85 PathProgramCache]: Analyzing trace with hash -942723908, now seen corresponding path program 1 times [2023-11-06 22:06:48,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:48,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216798314] [2023-11-06 22:06:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:48,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:48,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:48,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:06:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-06 22:06:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-06 22:06:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-11-06 22:06:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216798314] [2023-11-06 22:06:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216798314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:49,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:49,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911745488] [2023-11-06 22:06:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:49,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:49,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:49,146 INFO L87 Difference]: Start difference. First operand 1200 states and 1588 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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) [2023-11-06 22:06:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:50,911 INFO L93 Difference]: Finished difference Result 3169 states and 4321 transitions. [2023-11-06 22:06:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:50,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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 228 [2023-11-06 22:06:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:50,928 INFO L225 Difference]: With dead ends: 3169 [2023-11-06 22:06:50,928 INFO L226 Difference]: Without dead ends: 1977 [2023-11-06 22:06:50,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:50,933 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 381 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:50,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1681 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:06:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-11-06 22:06:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1206. [2023-11-06 22:06:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 962 states have (on average 1.2577962577962578) internal successors, (1210), 969 states have internal predecessors, (1210), 192 states have call successors, (192), 52 states have call predecessors, (192), 51 states have return successors, (192), 190 states have call predecessors, (192), 190 states have call successors, (192) [2023-11-06 22:06:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1594 transitions. [2023-11-06 22:06:51,145 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1594 transitions. Word has length 228 [2023-11-06 22:06:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:51,145 INFO L495 AbstractCegarLoop]: Abstraction has 1206 states and 1594 transitions. [2023-11-06 22:06:51,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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) [2023-11-06 22:06:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1594 transitions. [2023-11-06 22:06:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-06 22:06:51,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:51,154 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:51,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:06:51,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:51,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:51,155 INFO L85 PathProgramCache]: Analyzing trace with hash -34709340, now seen corresponding path program 1 times [2023-11-06 22:06:51,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:51,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586355385] [2023-11-06 22:06:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:06:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-06 22:06:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-06 22:06:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-11-06 22:06:51,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586355385] [2023-11-06 22:06:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586355385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:51,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:51,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:06:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961754842] [2023-11-06 22:06:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:51,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:51,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:51,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:51,811 INFO L87 Difference]: Start difference. First operand 1206 states and 1594 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 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) [2023-11-06 22:06:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:53,484 INFO L93 Difference]: Finished difference Result 2307 states and 3059 transitions. [2023-11-06 22:06:53,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:06:53,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 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 244 [2023-11-06 22:06:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:53,496 INFO L225 Difference]: With dead ends: 2307 [2023-11-06 22:06:53,497 INFO L226 Difference]: Without dead ends: 1109 [2023-11-06 22:06:53,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:53,503 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 612 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:53,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 787 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:06:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-11-06 22:06:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1019. [2023-11-06 22:06:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 795 states have (on average 1.241509433962264) internal successors, (987), 802 states have internal predecessors, (987), 172 states have call successors, (172), 52 states have call predecessors, (172), 51 states have return successors, (172), 170 states have call predecessors, (172), 170 states have call successors, (172) [2023-11-06 22:06:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1331 transitions. [2023-11-06 22:06:53,691 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1331 transitions. Word has length 244 [2023-11-06 22:06:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:53,692 INFO L495 AbstractCegarLoop]: Abstraction has 1019 states and 1331 transitions. [2023-11-06 22:06:53,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 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) [2023-11-06 22:06:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1331 transitions. [2023-11-06 22:06:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-06 22:06:53,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:53,700 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:53,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:06:53,701 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:53,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1061117764, now seen corresponding path program 2 times [2023-11-06 22:06:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:53,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723021262] [2023-11-06 22:06:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:06:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:06:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:06:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:06:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:06:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:06:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:06:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:06:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:06:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:06:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:06:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:06:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:06:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:06:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-06 22:06:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-06 22:06:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:06:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-11-06 22:06:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723021262] [2023-11-06 22:06:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723021262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:54,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886168411] [2023-11-06 22:06:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:06:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:54,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:06:54,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:54,683 INFO L87 Difference]: Start difference. First operand 1019 states and 1331 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 5 states have internal predecessors, (142), 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) [2023-11-06 22:06:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:56,763 INFO L93 Difference]: Finished difference Result 1469 states and 1952 transitions. [2023-11-06 22:06:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:06:56,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 5 states have internal predecessors, (142), 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 244 [2023-11-06 22:06:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:56,765 INFO L225 Difference]: With dead ends: 1469 [2023-11-06 22:06:56,765 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:06:56,769 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 [2023-11-06 22:06:56,770 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 1719 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1791 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:56,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1791 Valid, 814 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:06:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:06:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:06:56,772 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) [2023-11-06 22:06:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:06:56,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2023-11-06 22:06:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:56,773 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:06:56,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 5 states have internal predecessors, (142), 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) [2023-11-06 22:06:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:06:56,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:06:56,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:06:56,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:06:56,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:08:40,222 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2023-11-06 22:08:40,222 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 2594 2596) no Hoare annotation was computed. [2023-11-06 22:08:40,223 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2594 2596) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse3 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse1 (= |old(#valid)| |#valid|))) (and (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse1) (or .cse2 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse0 .cse3 .cse1) (or .cse2 .cse3 .cse1 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,223 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2553 2555) the Hoare annotation is: true [2023-11-06 22:08:40,223 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2023-11-06 22:08:40,223 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userFINAL(lines 2553 2555) no Hoare annotation was computed. [2023-11-06 22:08:40,223 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeFINAL(lines 2470 2484) no Hoare annotation was computed. [2023-11-06 22:08:40,224 INFO L895 garLoopResultBuilder]: At program point L2478(line 2478) the Hoare annotation is: (let ((.cse1 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1)) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1) (or .cse2 (< ~ldv_count_1~0 (+ 5 |old(~ldv_count_2~0)|)) .cse1) (or .cse2 (not (= |old(~ldv_count_2~0)| 0)) (< ~ldv_count_1~0 6)) (or (< ~ldv_count_1~0 (+ |old(~ldv_count_2~0)| 1)) .cse0))) [2023-11-06 22:08:40,224 INFO L899 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2023-11-06 22:08:40,224 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2470 2484) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1)) (.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 (< ~ldv_count_1~0 (+ 5 |old(~ldv_count_2~0)|)) .cse2) (or .cse3 .cse0 .cse2) (or (< ~ldv_count_1~0 (+ 2 |old(~ldv_count_2~0)|)) .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (or (< ~ldv_count_1~0 (+ |old(~ldv_count_2~0)| 1)) .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (or .cse1 (not (= |old(~ldv_count_2~0)| 0)) (< ~ldv_count_1~0 6) (= ~ldv_count_2~0 0)))) [2023-11-06 22:08:40,224 INFO L899 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2023-11-06 22:08:40,224 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2023-11-06 22:08:40,225 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2023-11-06 22:08:40,225 INFO L899 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2023-11-06 22:08:40,225 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2590 2592) the Hoare annotation is: true [2023-11-06 22:08:40,225 INFO L899 garLoopResultBuilder]: For program point wait_for_completionFINAL(lines 2590 2592) no Hoare annotation was computed. [2023-11-06 22:08:40,225 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 2545 2547) no Hoare annotation was computed. [2023-11-06 22:08:40,225 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2545 2547) the Hoare annotation is: true [2023-11-06 22:08:40,226 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2023-11-06 22:08:40,226 INFO L899 garLoopResultBuilder]: For program point dev_errFINAL(lines 2530 2532) no Hoare annotation was computed. [2023-11-06 22:08:40,226 INFO L899 garLoopResultBuilder]: For program point dev_errEXIT(lines 2530 2532) no Hoare annotation was computed. [2023-11-06 22:08:40,226 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2530 2532) the Hoare annotation is: true [2023-11-06 22:08:40,226 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2412 2417) no Hoare annotation was computed. [2023-11-06 22:08:40,226 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2412 2417) the Hoare annotation is: true [2023-11-06 22:08:40,227 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2023-11-06 22:08:40,227 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2023-11-06 22:08:40,227 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2023-11-06 22:08:40,227 INFO L899 garLoopResultBuilder]: For program point L1662-2(line 1662) no Hoare annotation was computed. [2023-11-06 22:08:40,227 INFO L895 garLoopResultBuilder]: At program point L1662-4(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 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,227 INFO L899 garLoopResultBuilder]: For program point L1662-5(line 1662) no Hoare annotation was computed. [2023-11-06 22:08:40,228 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 1658 1665) no Hoare annotation was computed. [2023-11-06 22:08:40,228 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,228 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2023-11-06 22:08:40,228 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 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,228 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2023-11-06 22:08:40,229 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,229 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 1649 1656) no Hoare annotation was computed. [2023-11-06 22:08:40,229 INFO L902 garLoopResultBuilder]: At program point __kmalloc_returnLabel#1(lines 1644 1647) the Hoare annotation is: true [2023-11-06 22:08:40,229 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2023-11-06 22:08:40,229 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2023-11-06 22:08:40,229 INFO L899 garLoopResultBuilder]: For program point extract_valueFINAL(lines 1676 1683) no Hoare annotation was computed. [2023-11-06 22:08:40,230 INFO L899 garLoopResultBuilder]: For program point L1567-2(line 1567) no Hoare annotation was computed. [2023-11-06 22:08:40,230 INFO L899 garLoopResultBuilder]: For program point L1567-4(line 1567) no Hoare annotation was computed. [2023-11-06 22:08:40,230 INFO L902 garLoopResultBuilder]: At program point __be16_to_cpup_returnLabel#1(lines 1578 1585) the Hoare annotation is: true [2023-11-06 22:08:40,230 INFO L899 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2023-11-06 22:08:40,230 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1676 1683) the Hoare annotation is: true [2023-11-06 22:08:40,230 INFO L902 garLoopResultBuilder]: At program point __swab16p_returnLabel#1(lines 1570 1577) the Hoare annotation is: true [2023-11-06 22:08:40,231 INFO L902 garLoopResultBuilder]: At program point __fswab16_returnLabel#1(lines 1564 1569) the Hoare annotation is: true [2023-11-06 22:08:40,231 INFO L899 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2023-11-06 22:08:40,231 INFO L902 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2023-11-06 22:08:40,231 INFO L895 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-06 22:08:40,231 INFO L902 garLoopResultBuilder]: At program point ldv_17716(lines 2201 2236) the Hoare annotation is: true [2023-11-06 22:08:40,231 INFO L902 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2023-11-06 22:08:40,231 INFO L902 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2023-11-06 22:08:40,232 INFO L902 garLoopResultBuilder]: At program point ldv_17719(lines 2201 2236) the Hoare annotation is: true [2023-11-06 22:08:40,232 INFO L899 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2023-11-06 22:08:40,232 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2023-11-06 22:08:40,232 INFO L899 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2023-11-06 22:08:40,232 INFO L902 garLoopResultBuilder]: At program point L2224(lines 2201 2236) the Hoare annotation is: true [2023-11-06 22:08:40,232 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-06 22:08:40,233 INFO L902 garLoopResultBuilder]: At program point L2216(lines 2201 2236) the Hoare annotation is: true [2023-11-06 22:08:40,233 INFO L902 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2023-11-06 22:08:40,233 INFO L902 garLoopResultBuilder]: At program point list_del_returnLabel#1(lines 2581 2583) the Hoare annotation is: true [2023-11-06 22:08:40,233 INFO L902 garLoopResultBuilder]: At program point $Ultimate##4(lines 2219 2222) the Hoare annotation is: true [2023-11-06 22:08:40,233 INFO L899 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2023-11-06 22:08:40,233 INFO L899 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2023-11-06 22:08:40,234 INFO L895 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-06 22:08:40,234 INFO L899 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2023-11-06 22:08:40,234 INFO L899 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2023-11-06 22:08:40,234 INFO L902 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2023-11-06 22:08:40,234 INFO L899 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2023-11-06 22:08:40,234 INFO L902 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2023-11-06 22:08:40,234 INFO L899 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2023-11-06 22:08:40,235 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2023-11-06 22:08:40,235 INFO L899 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2023-11-06 22:08:40,235 INFO L902 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2023-11-06 22:08:40,235 INFO L899 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2023-11-06 22:08:40,235 INFO L902 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2023-11-06 22:08:40,235 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2023-11-06 22:08:40,235 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2424 2429) the Hoare annotation is: true [2023-11-06 22:08:40,236 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 2424 2429) no Hoare annotation was computed. [2023-11-06 22:08:40,236 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2023-11-06 22:08:40,236 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2556 2558) the Hoare annotation is: true [2023-11-06 22:08:40,236 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgFINAL(lines 2556 2558) no Hoare annotation was computed. [2023-11-06 22:08:40,236 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2023-11-06 22:08:40,236 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2023-11-06 22:08:40,236 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2023-11-06 22:08:40,237 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,237 INFO L902 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2023-11-06 22:08:40,237 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2023-11-06 22:08:40,237 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2023-11-06 22:08:40,237 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2023-11-06 22:08:40,237 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2023-11-06 22:08:40,238 INFO L895 garLoopResultBuilder]: At program point ipmi_validate_addr_returnLabel#1(lines 2572 2574) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.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))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,238 INFO L895 garLoopResultBuilder]: At program point out(lines 1698 1718) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.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))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,238 INFO L902 garLoopResultBuilder]: At program point ipmi_request_settime_returnLabel#1(lines 2560 2562) the Hoare annotation is: true [2023-11-06 22:08:40,238 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2023-11-06 22:08:40,239 INFO L895 garLoopResultBuilder]: At program point L1716(line 1716) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.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))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,239 INFO L899 garLoopResultBuilder]: For program point L1716-1(line 1716) no Hoare annotation was computed. [2023-11-06 22:08:40,239 INFO L902 garLoopResultBuilder]: At program point L1713(line 1713) the Hoare annotation is: true [2023-11-06 22:08:40,239 INFO L899 garLoopResultBuilder]: For program point L1713-1(line 1713) no Hoare annotation was computed. [2023-11-06 22:08:40,239 INFO L899 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2023-11-06 22:08:40,239 INFO L902 garLoopResultBuilder]: At program point out1(lines 1698 1718) the Hoare annotation is: true [2023-11-06 22:08:40,240 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1695 1719) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.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))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,240 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2023-11-06 22:08:40,240 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2539 2541) the Hoare annotation is: true [2023-11-06 22:08:40,240 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2023-11-06 22:08:40,240 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 2539 2541) no Hoare annotation was computed. [2023-11-06 22:08:40,241 INFO L895 garLoopResultBuilder]: At program point ibmpex_query_sensor_name_returnLabel#1(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))) [2023-11-06 22:08:40,241 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(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)) [2023-11-06 22:08:40,241 INFO L899 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2023-11-06 22:08:40,241 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))) [2023-11-06 22:08:40,241 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))) [2023-11-06 22:08:40,241 INFO L899 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2023-11-06 22:08:40,242 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2023-11-06 22:08:40,242 INFO L895 garLoopResultBuilder]: At program point ibmpex_find_sensors_returnLabel#1(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))) [2023-11-06 22:08:40,242 INFO L899 garLoopResultBuilder]: For program point L2349(lines 2349 2364) no Hoare annotation was computed. [2023-11-06 22:08:40,242 INFO L899 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2023-11-06 22:08:40,242 INFO L895 garLoopResultBuilder]: At program point __list_add_returnLabel#1(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))) [2023-11-06 22:08:40,243 INFO L899 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2023-11-06 22:08:40,243 INFO L899 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2023-11-06 22:08:40,243 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))) [2023-11-06 22:08:40,243 INFO L899 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2023-11-06 22:08:40,243 INFO L899 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2023-11-06 22:08:40,243 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))) [2023-11-06 22:08:40,244 INFO L899 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2023-11-06 22:08:40,244 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2023-11-06 22:08:40,244 INFO L895 garLoopResultBuilder]: At program point L2154(lines 2154 2155) 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))) [2023-11-06 22:08:40,244 INFO L899 garLoopResultBuilder]: For program point L2154-1(lines 2154 2155) no Hoare annotation was computed. [2023-11-06 22:08:40,244 INFO L899 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2023-11-06 22:08:40,244 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))) [2023-11-06 22:08:40,245 INFO L899 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2023-11-06 22:08:40,245 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))) [2023-11-06 22:08:40,245 INFO L899 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2023-11-06 22:08:40,245 INFO L899 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2023-11-06 22:08:40,245 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_6_returnLabel#1(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))) [2023-11-06 22:08:40,246 INFO L895 garLoopResultBuilder]: At program point __init_waitqueue_head_returnLabel#1(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))) [2023-11-06 22:08:40,246 INFO L899 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2023-11-06 22:08:40,246 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))) [2023-11-06 22:08:40,246 INFO L899 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2023-11-06 22:08:40,246 INFO L899 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2023-11-06 22:08:40,246 INFO L899 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2023-11-06 22:08:40,246 INFO L899 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2023-11-06 22:08:40,247 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))) [2023-11-06 22:08:40,247 INFO L899 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2023-11-06 22:08:40,247 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_7_returnLabel#1(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))) [2023-11-06 22:08:40,247 INFO L899 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2023-11-06 22:08:40,247 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))) [2023-11-06 22:08:40,248 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))) [2023-11-06 22:08:40,248 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2023-11-06 22:08:40,248 INFO L899 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2023-11-06 22:08:40,248 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))) [2023-11-06 22:08:40,248 INFO L899 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2023-11-06 22:08:40,248 INFO L899 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2023-11-06 22:08:40,249 INFO L899 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2023-11-06 22:08:40,249 INFO L899 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2023-11-06 22:08:40,249 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))) [2023-11-06 22:08:40,249 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 2327 2378) the Hoare annotation is: true [2023-11-06 22:08:40,249 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))) [2023-11-06 22:08:40,250 INFO L899 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2023-11-06 22:08:40,250 INFO L895 garLoopResultBuilder]: At program point ipmi_create_user_returnLabel#1(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))) [2023-11-06 22:08:40,250 INFO L895 garLoopResultBuilder]: At program point ibmpex_find_sensors_ldv_17690#1(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))) [2023-11-06 22:08:40,250 INFO L899 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2023-11-06 22:08:40,250 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2023-11-06 22:08:40,251 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))) [2023-11-06 22:08:40,251 INFO L899 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2023-11-06 22:08:40,251 INFO L899 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2023-11-06 22:08:40,251 INFO L895 garLoopResultBuilder]: At program point __mutex_init_returnLabel#1(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))) [2023-11-06 22:08:40,251 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_5_returnLabel#1(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))) [2023-11-06 22:08:40,251 INFO L899 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2023-11-06 22:08:40,252 INFO L899 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2023-11-06 22:08:40,252 INFO L899 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2023-11-06 22:08:40,252 INFO L899 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2023-11-06 22:08:40,252 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))) [2023-11-06 22:08:40,252 INFO L899 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2023-11-06 22:08:40,252 INFO L902 garLoopResultBuilder]: At program point ibmpex_exit_returnLabel#1(lines 2295 2321) the Hoare annotation is: true [2023-11-06 22:08:40,253 INFO L899 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2023-11-06 22:08:40,253 INFO L895 garLoopResultBuilder]: At program point _dev_info_returnLabel#1(lines 2523 2525) 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))) [2023-11-06 22:08:40,253 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))) [2023-11-06 22:08:40,253 INFO L899 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2023-11-06 22:08:40,253 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2023-11-06 22:08:40,253 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2023-11-06 22:08:40,254 INFO L895 garLoopResultBuilder]: At program point ldv_sysfs_returnLabel#1(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)))) [2023-11-06 22:08:40,254 INFO L895 garLoopResultBuilder]: At program point L2262(lines 2262 2263) 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))) [2023-11-06 22:08:40,254 INFO L899 garLoopResultBuilder]: For program point L2262-1(lines 2262 2263) no Hoare annotation was computed. [2023-11-06 22:08:40,254 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))) [2023-11-06 22:08:40,254 INFO L899 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2023-11-06 22:08:40,255 INFO L895 garLoopResultBuilder]: At program point init_completion_returnLabel#1(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))) [2023-11-06 22:08:40,255 INFO L895 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2023-11-06 22:08:40,255 INFO L895 garLoopResultBuilder]: At program point ibmpex_register_bmc_returnLabel#1(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))) [2023-11-06 22:08:40,255 INFO L899 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2023-11-06 22:08:40,255 INFO L895 garLoopResultBuilder]: At program point list_add_tail_returnLabel#1(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))) [2023-11-06 22:08:40,256 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))) [2023-11-06 22:08:40,256 INFO L895 garLoopResultBuilder]: At program point L2264-1(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))) [2023-11-06 22:08:40,256 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))) [2023-11-06 22:08:40,257 INFO L899 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2023-11-06 22:08:40,257 INFO L902 garLoopResultBuilder]: At program point ipmi_smi_watcher_unregister_returnLabel#1(lines 2568 2570) the Hoare annotation is: true [2023-11-06 22:08:40,257 INFO L895 garLoopResultBuilder]: At program point complete_returnLabel#1(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))) [2023-11-06 22:08:40,257 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2023-11-06 22:08:40,257 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))) [2023-11-06 22:08:40,257 INFO L899 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2023-11-06 22:08:40,258 INFO L895 garLoopResultBuilder]: At program point ibmpex_find_sensors_ldv_17694#1(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))) [2023-11-06 22:08:40,258 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))) [2023-11-06 22:08:40,258 INFO L899 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2023-11-06 22:08:40,258 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))) [2023-11-06 22:08:40,259 INFO L899 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2023-11-06 22:08:40,259 INFO L899 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2023-11-06 22:08:40,259 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2023-11-06 22:08:40,259 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))) [2023-11-06 22:08:40,259 INFO L895 garLoopResultBuilder]: At program point $Ultimate##93(lines 1864 1867) 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))) [2023-11-06 22:08:40,260 INFO L895 garLoopResultBuilder]: At program point is_power_sensor_returnLabel#1(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))) [2023-11-06 22:08:40,260 INFO L899 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2023-11-06 22:08:40,260 INFO L895 garLoopResultBuilder]: At program point $Ultimate##83(lines 2117 2120) 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))) [2023-11-06 22:08:40,260 INFO L895 garLoopResultBuilder]: At program point ibmpex_init_returnLabel#1(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)) [2023-11-06 22:08:40,260 INFO L895 garLoopResultBuilder]: At program point get_bmc_data_returnLabel#1(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))) [2023-11-06 22:08:40,261 INFO L899 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2023-11-06 22:08:40,261 INFO L895 garLoopResultBuilder]: At program point get_bmc_data_ldv_17622#1(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))) [2023-11-06 22:08:40,261 INFO L899 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2023-11-06 22:08:40,261 INFO L902 garLoopResultBuilder]: At program point ibmpex_exit_ldv_17748#1(lines 2302 2320) the Hoare annotation is: true [2023-11-06 22:08:40,261 INFO L899 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2023-11-06 22:08:40,261 INFO L899 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2023-11-06 22:08:40,262 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))) [2023-11-06 22:08:40,262 INFO L899 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2023-11-06 22:08:40,262 INFO L895 garLoopResultBuilder]: At program point create_sensor_returnLabel#1(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))) [2023-11-06 22:08:40,262 INFO L895 garLoopResultBuilder]: At program point $Ultimate##73(lines 2077 2080) 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)))) [2023-11-06 22:08:40,263 INFO L895 garLoopResultBuilder]: At program point ibmpex_find_sensors_exit_remove#1(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))) [2023-11-06 22:08:40,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:08:40,263 INFO L899 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2023-11-06 22:08:40,263 INFO L899 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2023-11-06 22:08:40,263 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))) [2023-11-06 22:08:40,263 INFO L899 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2023-11-06 22:08:40,264 INFO L899 garLoopResultBuilder]: For program point L2173-1(lines 2173 2174) no Hoare annotation was computed. [2023-11-06 22:08:40,264 INFO L895 garLoopResultBuilder]: At program point L2173(lines 2173 2174) 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))) [2023-11-06 22:08:40,264 INFO L902 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2023-11-06 22:08:40,264 INFO L895 garLoopResultBuilder]: At program point $Ultimate##45(lines 1969 1972) 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))) [2023-11-06 22:08:40,264 INFO L899 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2023-11-06 22:08:40,265 INFO L895 garLoopResultBuilder]: At program point ibmpex_find_sensors_ldv_17687#1(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)))) [2023-11-06 22:08:40,265 INFO L899 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2023-11-06 22:08:40,265 INFO L899 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2023-11-06 22:08:40,265 INFO L895 garLoopResultBuilder]: At program point ibmpex_ver_check_returnLabel#1(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))) [2023-11-06 22:08:40,265 INFO L895 garLoopResultBuilder]: At program point is_temp_sensor_returnLabel#1(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)))) [2023-11-06 22:08:40,266 INFO L895 garLoopResultBuilder]: At program point IS_ERR_returnLabel#1(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))) [2023-11-06 22:08:40,266 INFO L895 garLoopResultBuilder]: At program point power_sensor_multiplier_ldv_17663#1(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))) [2023-11-06 22:08:40,266 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)) [2023-11-06 22:08:40,266 INFO L899 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2023-11-06 22:08:40,266 INFO L899 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2023-11-06 22:08:40,267 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))) [2023-11-06 22:08:40,267 INFO L895 garLoopResultBuilder]: At program point L2142(line 2142) 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))) [2023-11-06 22:08:40,267 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:08:40,267 INFO L899 garLoopResultBuilder]: For program point L2142-1(line 2142) no Hoare annotation was computed. [2023-11-06 22:08:40,267 INFO L899 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2023-11-06 22:08:40,268 INFO L895 garLoopResultBuilder]: At program point power_sensor_multiplier_returnLabel#1(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))) [2023-11-06 22:08:40,268 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))) [2023-11-06 22:08:40,268 INFO L899 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2023-11-06 22:08:40,268 INFO L895 garLoopResultBuilder]: At program point main_ldv_17796#1(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))) [2023-11-06 22:08:40,268 INFO L899 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2023-11-06 22:08:40,268 INFO L902 garLoopResultBuilder]: At program point L2374(lines 2337 2377) the Hoare annotation is: true [2023-11-06 22:08:40,269 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))) [2023-11-06 22:08:40,269 INFO L895 garLoopResultBuilder]: At program point ibmpex_register_bmc_out_register#1(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))) [2023-11-06 22:08:40,269 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))) [2023-11-06 22:08:40,269 INFO L899 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2023-11-06 22:08:40,270 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_dev_attr_of_sensor_device_attribute_2_returnLabel#1(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))) [2023-11-06 22:08:40,270 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:08:40,270 INFO L899 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2023-11-06 22:08:40,270 INFO L895 garLoopResultBuilder]: At program point ibmpex_find_sensors_ldv_17697#1(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))) [2023-11-06 22:08:40,270 INFO L899 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2023-11-06 22:08:40,270 INFO L899 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2023-11-06 22:08:40,271 INFO L899 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2023-11-06 22:08:40,271 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))) [2023-11-06 22:08:40,271 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))) [2023-11-06 22:08:40,271 INFO L899 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2023-11-06 22:08:40,271 INFO L899 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2023-11-06 22:08:40,272 INFO L899 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2023-11-06 22:08:40,272 INFO L899 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2023-11-06 22:08:40,272 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))) [2023-11-06 22:08:40,272 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:08:40,272 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))) [2023-11-06 22:08:40,272 INFO L895 garLoopResultBuilder]: At program point hwmon_device_register_returnLabel#1(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))) [2023-11-06 22:08:40,273 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))) [2023-11-06 22:08:40,273 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2023-11-06 22:08:40,273 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2023-11-06 22:08:40,273 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))) [2023-11-06 22:08:40,273 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))) [2023-11-06 22:08:40,274 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))) [2023-11-06 22:08:40,274 INFO L899 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2023-11-06 22:08:40,274 INFO L895 garLoopResultBuilder]: At program point ibmpex_query_sensor_count_returnLabel#1(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))) [2023-11-06 22:08:40,274 INFO L899 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2023-11-06 22:08:40,274 INFO L895 garLoopResultBuilder]: At program point ipmi_smi_watcher_register_returnLabel#1(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)) [2023-11-06 22:08:40,275 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)))) [2023-11-06 22:08:40,275 INFO L902 garLoopResultBuilder]: At program point $Ultimate##117(lines 2315 2318) the Hoare annotation is: true [2023-11-06 22:08:40,275 INFO L899 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2023-11-06 22:08:40,275 INFO L895 garLoopResultBuilder]: At program point L2182(lines 2182 2183) 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))) [2023-11-06 22:08:40,275 INFO L899 garLoopResultBuilder]: For program point L2182-1(lines 2182 2183) no Hoare annotation was computed. [2023-11-06 22:08:40,276 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))) [2023-11-06 22:08:40,276 INFO L902 garLoopResultBuilder]: At program point ldv_check_final_state_returnLabel#1(lines 2575 2577) the Hoare annotation is: true [2023-11-06 22:08:40,276 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 2536 2538) no Hoare annotation was computed. [2023-11-06 22:08:40,276 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2023-11-06 22:08:40,276 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2536 2538) the Hoare annotation is: true [2023-11-06 22:08:40,279 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:40,282 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:08:40,318 ERROR L462 ceAbstractionStarter]: Failed to backtranslate (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.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))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,332 ERROR L462 ceAbstractionStarter]: Failed to backtranslate (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.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))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-06 22:08:40,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:08:40 BoogieIcfgContainer [2023-11-06 22:08:40,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:08:40,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:08:40,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:08:40,344 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:08:40,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:16" (3/4) ... [2023-11-06 22:08:40,347 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:08:40,351 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-06 22:08:40,351 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2023-11-06 22:08:40,351 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-06 22:08:40,351 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2023-11-06 22:08:40,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2023-11-06 22:08:40,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2023-11-06 22:08:40,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2023-11-06 22:08:40,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2023-11-06 22:08:40,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2023-11-06 22:08:40,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-06 22:08:40,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2023-11-06 22:08:40,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-06 22:08:40,353 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2023-11-06 22:08:40,353 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2023-11-06 22:08:40,353 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2023-11-06 22:08:40,353 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2023-11-06 22:08:40,353 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2023-11-06 22:08:40,354 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2023-11-06 22:08:40,377 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 124 nodes and edges [2023-11-06 22:08:40,380 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2023-11-06 22:08:40,382 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:08:40,385 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-06 22:08:40,388 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:08:40,391 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:08:40,425 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))) [2023-11-06 22:08:40,560 WARN L115 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))) [2023-11-06 22:08:40,642 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:08:40,642 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:08:40,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:08:40,656 INFO L158 Benchmark]: Toolchain (without parser) took 148357.94ms. Allocated memory was 144.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 97.6MB in the beginning and 1.1GB in the end (delta: -956.4MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2023-11-06 22:08:40,657 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 144.7MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:08:40,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1414.45ms. Allocated memory is still 144.7MB. Free memory was 97.3MB in the beginning and 49.4MB in the end (delta: 47.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2023-11-06 22:08:40,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 188.61ms. Allocated memory is still 144.7MB. Free memory was 49.4MB in the beginning and 107.9MB in the end (delta: -58.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2023-11-06 22:08:40,658 INFO L158 Benchmark]: Boogie Preprocessor took 138.41ms. Allocated memory is still 144.7MB. Free memory was 107.9MB in the beginning and 99.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:08:40,658 INFO L158 Benchmark]: RCFGBuilder took 2235.94ms. Allocated memory is still 144.7MB. Free memory was 99.5MB in the beginning and 63.7MB in the end (delta: 35.8MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2023-11-06 22:08:40,659 INFO L158 Benchmark]: TraceAbstraction took 144073.99ms. Allocated memory was 144.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 62.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 689.5MB. Max. memory is 16.1GB. [2023-11-06 22:08:40,659 INFO L158 Benchmark]: Witness Printer took 298.82ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-06 22:08:40,661 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70ms. Allocated memory is still 144.7MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1414.45ms. Allocated memory is still 144.7MB. Free memory was 97.3MB in the beginning and 49.4MB in the end (delta: 47.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 188.61ms. Allocated memory is still 144.7MB. Free memory was 49.4MB in the beginning and 107.9MB in the end (delta: -58.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.41ms. Allocated memory is still 144.7MB. Free memory was 107.9MB in the beginning and 99.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2235.94ms. Allocated memory is still 144.7MB. Free memory was 99.5MB in the beginning and 63.7MB in the end (delta: 35.8MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * TraceAbstraction took 144073.99ms. Allocated memory was 144.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 62.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 689.5MB. Max. memory is 16.1GB. * Witness Printer took 298.82ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2415]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 298 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 143.9s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 25.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 103.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8411 SdHoareTripleChecker+Valid, 20.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7868 mSDsluCounter, 19706 SdHoareTripleChecker+Invalid, 17.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13426 mSDsCounter, 3053 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10329 IncrementalHoareTripleChecker+Invalid, 13382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3053 mSolverCounterUnsat, 6280 mSDtfsCounter, 10329 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1290 GetRequests, 1185 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1604occurred in iteration=12, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 5637 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 143 LocationsWithAnnotation, 4482 PreInvPairs, 5236 NumberOfFragments, 4415 HoareAnnotationTreeSize, 4482 FomulaSimplifications, 92125674 FormulaSimplificationTreeSizeReduction, 85.7s HoareSimplificationTime, 143 FomulaSimplificationsInter, 320498 FormulaSimplificationTreeSizeReductionInter, 17.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 3240 NumberOfCodeBlocks, 3240 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3415 ConstructedInterpolants, 0 QuantifiedInterpolants, 5579 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3717 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 1642/1646 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: 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: 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: 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: 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: 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: 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: 1570]: Loop Invariant Derived loop invariant: 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: 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: 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: 2201]: 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: 2117]: 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: 2077]: 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: 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: 2523]: 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: 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: 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: 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: 1644]: Loop Invariant Derived loop invariant: 1 - 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: 2315]: Loop Invariant Derived loop invariant: 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: 2295]: 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: 1564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2572]: Loop Invariant Derived loop invariant: NULL - 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: 2560]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2568]: Loop Invariant Derived loop invariant: 1 - 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: 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: -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: 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: 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 == 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: 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: 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: ((((((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: 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: 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: 1698]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1969]: 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: 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: 1698]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 2337]: Loop Invariant Derived loop invariant: 1 - 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: 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: 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: 2581]: Loop Invariant Derived loop invariant: 1 - 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: 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: 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: 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: 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: -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: 2327]: Loop Invariant Derived loop invariant: 1 - 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: 2201]: Loop Invariant Derived loop invariant: 1 - 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: 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: 2302]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1578]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2201]: Loop Invariant Derived loop invariant: 1 - 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: 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: 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: 1864]: 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: 2219]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-06 22:08:40,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c7eaf5a-5785-4c84-a132-b465e67e0f6c/bin/uautomizer-verify-WvqO1wxjHP/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